/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 23:29:57,136 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 23:29:57,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 23:29:57,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 23:29:57,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 23:29:57,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 23:29:57,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 23:29:57,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 23:29:57,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 23:29:57,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 23:29:57,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 23:29:57,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 23:29:57,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 23:29:57,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 23:29:57,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 23:29:57,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 23:29:57,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 23:29:57,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 23:29:57,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 23:29:57,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 23:29:57,201 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 23:29:57,206 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 23:29:57,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 23:29:57,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 23:29:57,209 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 23:29:57,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 23:29:57,210 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 23:29:57,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 23:29:57,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 23:29:57,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 23:29:57,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 23:29:57,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 23:29:57,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 23:29:57,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 23:29:57,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 23:29:57,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 23:29:57,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 23:29:57,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 23:29:57,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 23:29:57,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 23:29:57,223 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 23:29:57,224 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-MCR.epf [2019-12-27 23:29:57,261 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 23:29:57,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 23:29:57,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 23:29:57,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 23:29:57,263 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 23:29:57,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 23:29:57,265 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 23:29:57,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 23:29:57,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 23:29:57,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 23:29:57,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 23:29:57,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 23:29:57,267 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 23:29:57,267 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 23:29:57,267 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 23:29:57,267 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 23:29:57,267 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 23:29:57,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 23:29:57,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 23:29:57,268 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 23:29:57,268 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 23:29:57,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:29:57,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 23:29:57,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 23:29:57,270 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 23:29:57,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 23:29:57,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 23:29:57,271 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 23:29:57,271 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 23:29:57,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 23:29:57,271 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 23:29:57,271 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 23:29:57,593 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 23:29:57,614 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 23:29:57,617 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 23:29:57,619 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 23:29:57,620 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 23:29:57,621 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2019-12-27 23:29:57,699 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69938f971/a7be906611254fa0b1b43e634082e94b/FLAG5ce5aae38 [2019-12-27 23:29:58,253 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 23:29:58,254 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2019-12-27 23:29:58,276 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69938f971/a7be906611254fa0b1b43e634082e94b/FLAG5ce5aae38 [2019-12-27 23:29:58,525 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69938f971/a7be906611254fa0b1b43e634082e94b [2019-12-27 23:29:58,535 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 23:29:58,538 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 23:29:58,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 23:29:58,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 23:29:58,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 23:29:58,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:29:58" (1/1) ... [2019-12-27 23:29:58,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fbfd9ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:29:58, skipping insertion in model container [2019-12-27 23:29:58,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:29:58" (1/1) ... [2019-12-27 23:29:58,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 23:29:58,609 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 23:29:59,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:29:59,241 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 23:29:59,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:29:59,519 INFO L208 MainTranslator]: Completed translation [2019-12-27 23:29:59,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:29:59 WrapperNode [2019-12-27 23:29:59,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 23:29:59,521 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 23:29:59,522 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 23:29:59,524 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 23:29:59,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:29:59" (1/1) ... [2019-12-27 23:29:59,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:29:59" (1/1) ... [2019-12-27 23:29:59,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 23:29:59,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 23:29:59,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 23:29:59,623 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 23:29:59,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:29:59" (1/1) ... [2019-12-27 23:29:59,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:29:59" (1/1) ... [2019-12-27 23:29:59,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:29:59" (1/1) ... [2019-12-27 23:29:59,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:29:59" (1/1) ... [2019-12-27 23:29:59,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:29:59" (1/1) ... [2019-12-27 23:29:59,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:29:59" (1/1) ... [2019-12-27 23:29:59,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:29:59" (1/1) ... [2019-12-27 23:29:59,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 23:29:59,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 23:29:59,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 23:29:59,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 23:29:59,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:29:59" (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-12-27 23:29:59,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 23:29:59,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 23:29:59,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 23:29:59,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2019-12-27 23:29:59,723 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2019-12-27 23:29:59,723 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2019-12-27 23:29:59,723 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2019-12-27 23:29:59,723 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2019-12-27 23:29:59,723 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2019-12-27 23:29:59,723 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2019-12-27 23:29:59,724 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2019-12-27 23:29:59,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 23:29:59,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-27 23:29:59,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 23:29:59,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 23:29:59,726 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 23:30:00,197 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 23:30:00,197 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-27 23:30:00,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:30:00 BoogieIcfgContainer [2019-12-27 23:30:00,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 23:30:00,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 23:30:00,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 23:30:00,203 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 23:30:00,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:29:58" (1/3) ... [2019-12-27 23:30:00,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2a47a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:30:00, skipping insertion in model container [2019-12-27 23:30:00,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:29:59" (2/3) ... [2019-12-27 23:30:00,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2a47a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:30:00, skipping insertion in model container [2019-12-27 23:30:00,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:30:00" (3/3) ... [2019-12-27 23:30:00,206 INFO L109 eAbstractionObserver]: Analyzing ICFG singleton.i [2019-12-27 23:30:00,216 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 23:30:00,217 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 23:30:00,226 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 23:30:00,227 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 23:30:00,266 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,267 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,267 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,267 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,268 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,268 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,268 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,268 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,269 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,269 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,269 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,270 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,270 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,270 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,270 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,270 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,271 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,271 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,271 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,272 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,272 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,273 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,273 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,273 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,273 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,274 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,274 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,274 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,275 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,275 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,275 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,275 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,276 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,276 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,276 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,276 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,277 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,277 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,277 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,277 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,277 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,278 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,278 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,278 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,278 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,279 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,279 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,279 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,279 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,280 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,280 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,280 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,280 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,280 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,281 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,281 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,281 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,281 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,282 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,282 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,282 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,282 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,282 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,283 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,283 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,283 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,283 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,284 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,284 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,284 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,284 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,284 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,285 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,285 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,285 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,285 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,286 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,286 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,286 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,286 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,287 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,287 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,287 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,287 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,287 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,288 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,288 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,288 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,288 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,289 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,289 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,289 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,289 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,290 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,290 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,290 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,290 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,290 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,291 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,291 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,294 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,295 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,295 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,295 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,300 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,301 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,301 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,301 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,304 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,305 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,305 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,305 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,307 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,307 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,308 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,308 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,308 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,309 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,309 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,309 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,309 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,309 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,310 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,310 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,310 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,310 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,310 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,310 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,311 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,311 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,311 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,311 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,311 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,312 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,312 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,312 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,323 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,324 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,324 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,324 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,325 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,325 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,327 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,327 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,327 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,327 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,331 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,331 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,331 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,331 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,331 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,332 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,333 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,334 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,334 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,334 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,336 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,336 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,337 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,337 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,339 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,339 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,339 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,339 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,341 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,342 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,342 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,342 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:00,518 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-12-27 23:30:00,540 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:30:00,540 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:30:00,541 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:30:00,541 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:30:00,541 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:30:00,541 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:30:00,541 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:30:00,541 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:30:00,570 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 172 places, 243 transitions [2019-12-27 23:30:05,740 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 47313 states. [2019-12-27 23:30:05,742 INFO L276 IsEmpty]: Start isEmpty. Operand 47313 states. [2019-12-27 23:30:05,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 23:30:05,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:05,753 INFO L411 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-12-27 23:30:05,754 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-12-27 23:30:05,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:05,759 INFO L82 PathProgramCache]: Analyzing trace with hash -386252412, now seen corresponding path program 1 times [2019-12-27 23:30:05,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:05,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738445344] [2019-12-27 23:30:05,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:06,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:06,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738445344] [2019-12-27 23:30:06,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:06,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:30:06,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1014324295] [2019-12-27 23:30:06,071 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:06,080 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:06,106 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 56 transitions. [2019-12-27 23:30:06,106 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:06,208 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:30:06,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:30:06,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:06,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:30:06,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:30:06,231 INFO L87 Difference]: Start difference. First operand 47313 states. Second operand 7 states. [2019-12-27 23:30:07,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:07,294 INFO L93 Difference]: Finished difference Result 53971 states and 232572 transitions. [2019-12-27 23:30:07,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:30:07,296 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-27 23:30:07,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:07,602 INFO L225 Difference]: With dead ends: 53971 [2019-12-27 23:30:07,602 INFO L226 Difference]: Without dead ends: 38046 [2019-12-27 23:30:07,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:30:07,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38046 states. [2019-12-27 23:30:10,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38046 to 31407. [2019-12-27 23:30:10,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31407 states. [2019-12-27 23:30:10,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31407 states to 31407 states and 135821 transitions. [2019-12-27 23:30:10,739 INFO L78 Accepts]: Start accepts. Automaton has 31407 states and 135821 transitions. Word has length 32 [2019-12-27 23:30:10,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:10,740 INFO L462 AbstractCegarLoop]: Abstraction has 31407 states and 135821 transitions. [2019-12-27 23:30:10,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:30:10,740 INFO L276 IsEmpty]: Start isEmpty. Operand 31407 states and 135821 transitions. [2019-12-27 23:30:10,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 23:30:10,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:10,742 INFO L411 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-12-27 23:30:10,743 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-12-27 23:30:10,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:10,743 INFO L82 PathProgramCache]: Analyzing trace with hash -759214558, now seen corresponding path program 2 times [2019-12-27 23:30:10,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:10,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585239684] [2019-12-27 23:30:10,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:10,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585239684] [2019-12-27 23:30:10,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:10,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 23:30:10,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [569718268] [2019-12-27 23:30:10,976 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:10,981 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:10,988 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 70 transitions. [2019-12-27 23:30:10,988 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:11,059 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 23:30:11,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:30:11,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:11,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:30:11,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:30:11,063 INFO L87 Difference]: Start difference. First operand 31407 states and 135821 transitions. Second operand 10 states. [2019-12-27 23:30:11,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:11,967 INFO L93 Difference]: Finished difference Result 38026 states and 167038 transitions. [2019-12-27 23:30:11,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:30:11,967 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-12-27 23:30:11,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:13,976 INFO L225 Difference]: With dead ends: 38026 [2019-12-27 23:30:13,977 INFO L226 Difference]: Without dead ends: 38026 [2019-12-27 23:30:13,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:30:14,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38026 states. [2019-12-27 23:30:15,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38026 to 31364. [2019-12-27 23:30:15,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31364 states. [2019-12-27 23:30:15,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31364 states to 31364 states and 135748 transitions. [2019-12-27 23:30:15,237 INFO L78 Accepts]: Start accepts. Automaton has 31364 states and 135748 transitions. Word has length 32 [2019-12-27 23:30:15,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:15,238 INFO L462 AbstractCegarLoop]: Abstraction has 31364 states and 135748 transitions. [2019-12-27 23:30:15,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:30:15,238 INFO L276 IsEmpty]: Start isEmpty. Operand 31364 states and 135748 transitions. [2019-12-27 23:30:15,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 23:30:15,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:15,249 INFO L411 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-12-27 23:30:15,249 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-12-27 23:30:15,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:15,250 INFO L82 PathProgramCache]: Analyzing trace with hash -573780194, now seen corresponding path program 1 times [2019-12-27 23:30:15,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:15,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267585066] [2019-12-27 23:30:15,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:15,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:15,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267585066] [2019-12-27 23:30:15,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:15,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:30:15,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1811120531] [2019-12-27 23:30:15,373 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:15,382 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:15,393 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 86 transitions. [2019-12-27 23:30:15,393 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:15,439 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:30:15,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:30:15,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:15,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:30:15,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:30:15,440 INFO L87 Difference]: Start difference. First operand 31364 states and 135748 transitions. Second operand 7 states. [2019-12-27 23:30:15,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:15,857 INFO L93 Difference]: Finished difference Result 37554 states and 163555 transitions. [2019-12-27 23:30:15,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:30:15,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-27 23:30:15,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:15,965 INFO L225 Difference]: With dead ends: 37554 [2019-12-27 23:30:15,965 INFO L226 Difference]: Without dead ends: 37554 [2019-12-27 23:30:15,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:30:16,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37554 states. [2019-12-27 23:30:19,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37554 to 35091. [2019-12-27 23:30:19,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35091 states. [2019-12-27 23:30:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35091 states to 35091 states and 153592 transitions. [2019-12-27 23:30:19,174 INFO L78 Accepts]: Start accepts. Automaton has 35091 states and 153592 transitions. Word has length 42 [2019-12-27 23:30:19,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:19,174 INFO L462 AbstractCegarLoop]: Abstraction has 35091 states and 153592 transitions. [2019-12-27 23:30:19,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:30:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 35091 states and 153592 transitions. [2019-12-27 23:30:19,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 23:30:19,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:19,179 INFO L411 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-12-27 23:30:19,179 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-12-27 23:30:19,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:19,180 INFO L82 PathProgramCache]: Analyzing trace with hash 40373214, now seen corresponding path program 2 times [2019-12-27 23:30:19,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:19,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601966868] [2019-12-27 23:30:19,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:19,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-12-27 23:30:19,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601966868] [2019-12-27 23:30:19,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:19,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:30:19,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1125817685] [2019-12-27 23:30:19,262 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:19,269 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:19,288 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 100 states and 176 transitions. [2019-12-27 23:30:19,289 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:19,290 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:30:19,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:30:19,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:19,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:30:19,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:30:19,291 INFO L87 Difference]: Start difference. First operand 35091 states and 153592 transitions. Second operand 6 states. [2019-12-27 23:30:20,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:20,239 INFO L93 Difference]: Finished difference Result 74226 states and 316463 transitions. [2019-12-27 23:30:20,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 23:30:20,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-27 23:30:20,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:20,374 INFO L225 Difference]: With dead ends: 74226 [2019-12-27 23:30:20,374 INFO L226 Difference]: Without dead ends: 46039 [2019-12-27 23:30:20,374 INFO L631 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-12-27 23:30:20,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46039 states. [2019-12-27 23:30:23,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46039 to 35488. [2019-12-27 23:30:23,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35488 states. [2019-12-27 23:30:23,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35488 states to 35488 states and 149278 transitions. [2019-12-27 23:30:23,240 INFO L78 Accepts]: Start accepts. Automaton has 35488 states and 149278 transitions. Word has length 42 [2019-12-27 23:30:23,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:23,240 INFO L462 AbstractCegarLoop]: Abstraction has 35488 states and 149278 transitions. [2019-12-27 23:30:23,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:30:23,240 INFO L276 IsEmpty]: Start isEmpty. Operand 35488 states and 149278 transitions. [2019-12-27 23:30:23,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:30:23,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:23,256 INFO L411 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-12-27 23:30:23,256 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-12-27 23:30:23,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:23,256 INFO L82 PathProgramCache]: Analyzing trace with hash 210281631, now seen corresponding path program 1 times [2019-12-27 23:30:23,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:23,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238533691] [2019-12-27 23:30:23,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:23,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:23,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238533691] [2019-12-27 23:30:23,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:23,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 23:30:23,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1894824596] [2019-12-27 23:30:23,366 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:23,372 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:23,394 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 112 states and 198 transitions. [2019-12-27 23:30:23,394 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:23,421 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 23:30:23,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:30:23,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:23,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:30:23,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:30:23,422 INFO L87 Difference]: Start difference. First operand 35488 states and 149278 transitions. Second operand 9 states. [2019-12-27 23:30:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:24,320 INFO L93 Difference]: Finished difference Result 42306 states and 178056 transitions. [2019-12-27 23:30:24,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 23:30:24,320 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2019-12-27 23:30:24,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:24,432 INFO L225 Difference]: With dead ends: 42306 [2019-12-27 23:30:24,432 INFO L226 Difference]: Without dead ends: 42234 [2019-12-27 23:30:24,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:30:24,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42234 states. [2019-12-27 23:30:25,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42234 to 35467. [2019-12-27 23:30:25,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35467 states. [2019-12-27 23:30:25,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35467 states to 35467 states and 149246 transitions. [2019-12-27 23:30:25,631 INFO L78 Accepts]: Start accepts. Automaton has 35467 states and 149246 transitions. Word has length 44 [2019-12-27 23:30:25,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:25,631 INFO L462 AbstractCegarLoop]: Abstraction has 35467 states and 149246 transitions. [2019-12-27 23:30:25,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:30:25,632 INFO L276 IsEmpty]: Start isEmpty. Operand 35467 states and 149246 transitions. [2019-12-27 23:30:25,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:30:25,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:25,643 INFO L411 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-12-27 23:30:25,643 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-12-27 23:30:25,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:25,644 INFO L82 PathProgramCache]: Analyzing trace with hash 819066901, now seen corresponding path program 2 times [2019-12-27 23:30:25,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:25,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631019350] [2019-12-27 23:30:25,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:25,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:25,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631019350] [2019-12-27 23:30:25,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:25,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 23:30:25,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [313107440] [2019-12-27 23:30:25,770 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:25,776 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:25,798 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 168 transitions. [2019-12-27 23:30:25,799 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:25,800 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 23:30:25,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:30:25,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:25,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:30:25,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:30:25,802 INFO L87 Difference]: Start difference. First operand 35467 states and 149246 transitions. Second operand 10 states. [2019-12-27 23:30:26,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:26,600 INFO L93 Difference]: Finished difference Result 49949 states and 204488 transitions. [2019-12-27 23:30:26,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:30:26,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-12-27 23:30:26,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:26,754 INFO L225 Difference]: With dead ends: 49949 [2019-12-27 23:30:26,754 INFO L226 Difference]: Without dead ends: 45133 [2019-12-27 23:30:26,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 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-12-27 23:30:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45133 states. [2019-12-27 23:30:29,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45133 to 35382. [2019-12-27 23:30:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35382 states. [2019-12-27 23:30:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35382 states to 35382 states and 148988 transitions. [2019-12-27 23:30:29,627 INFO L78 Accepts]: Start accepts. Automaton has 35382 states and 148988 transitions. Word has length 44 [2019-12-27 23:30:29,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:29,627 INFO L462 AbstractCegarLoop]: Abstraction has 35382 states and 148988 transitions. [2019-12-27 23:30:29,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:30:29,627 INFO L276 IsEmpty]: Start isEmpty. Operand 35382 states and 148988 transitions. [2019-12-27 23:30:29,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 23:30:29,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:29,639 INFO L411 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-12-27 23:30:29,639 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-12-27 23:30:29,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:29,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1040550282, now seen corresponding path program 1 times [2019-12-27 23:30:29,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:29,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778978290] [2019-12-27 23:30:29,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:29,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778978290] [2019-12-27 23:30:29,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:29,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:30:29,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1254051260] [2019-12-27 23:30:29,719 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:29,725 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:29,738 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 89 transitions. [2019-12-27 23:30:29,738 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:29,784 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:30:29,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:30:29,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:29,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:30:29,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:30:29,786 INFO L87 Difference]: Start difference. First operand 35382 states and 148988 transitions. Second operand 7 states. [2019-12-27 23:30:30,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:30,173 INFO L93 Difference]: Finished difference Result 41393 states and 173198 transitions. [2019-12-27 23:30:30,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:30:30,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-12-27 23:30:30,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:30,682 INFO L225 Difference]: With dead ends: 41393 [2019-12-27 23:30:30,682 INFO L226 Difference]: Without dead ends: 40913 [2019-12-27 23:30:30,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:30:30,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40913 states. [2019-12-27 23:30:31,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40913 to 38965. [2019-12-27 23:30:31,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38965 states. [2019-12-27 23:30:31,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38965 states to 38965 states and 164378 transitions. [2019-12-27 23:30:31,407 INFO L78 Accepts]: Start accepts. Automaton has 38965 states and 164378 transitions. Word has length 45 [2019-12-27 23:30:31,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:31,407 INFO L462 AbstractCegarLoop]: Abstraction has 38965 states and 164378 transitions. [2019-12-27 23:30:31,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:30:31,407 INFO L276 IsEmpty]: Start isEmpty. Operand 38965 states and 164378 transitions. [2019-12-27 23:30:31,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 23:30:31,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:31,421 INFO L411 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-12-27 23:30:31,421 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-12-27 23:30:31,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:31,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1357053514, now seen corresponding path program 2 times [2019-12-27 23:30:31,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:31,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500058522] [2019-12-27 23:30:31,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:31,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500058522] [2019-12-27 23:30:31,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:31,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 23:30:31,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1241863971] [2019-12-27 23:30:31,531 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:31,538 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:32,064 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 103 states and 179 transitions. [2019-12-27 23:30:32,065 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:32,096 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 23:30:32,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:30:32,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:32,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:30:32,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:30:32,097 INFO L87 Difference]: Start difference. First operand 38965 states and 164378 transitions. Second operand 9 states. [2019-12-27 23:30:32,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:32,755 INFO L93 Difference]: Finished difference Result 41852 states and 174248 transitions. [2019-12-27 23:30:32,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 23:30:32,759 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2019-12-27 23:30:32,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:32,860 INFO L225 Difference]: With dead ends: 41852 [2019-12-27 23:30:32,860 INFO L226 Difference]: Without dead ends: 41372 [2019-12-27 23:30:32,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:30:33,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41372 states. [2019-12-27 23:30:34,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41372 to 36093. [2019-12-27 23:30:34,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36093 states. [2019-12-27 23:30:34,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36093 states to 36093 states and 150964 transitions. [2019-12-27 23:30:34,261 INFO L78 Accepts]: Start accepts. Automaton has 36093 states and 150964 transitions. Word has length 45 [2019-12-27 23:30:34,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:34,261 INFO L462 AbstractCegarLoop]: Abstraction has 36093 states and 150964 transitions. [2019-12-27 23:30:34,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:30:34,261 INFO L276 IsEmpty]: Start isEmpty. Operand 36093 states and 150964 transitions. [2019-12-27 23:30:34,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 23:30:34,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:34,272 INFO L411 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-12-27 23:30:34,273 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-12-27 23:30:34,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:34,273 INFO L82 PathProgramCache]: Analyzing trace with hash 335420672, now seen corresponding path program 3 times [2019-12-27 23:30:34,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:34,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29319579] [2019-12-27 23:30:34,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:34,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:34,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29319579] [2019-12-27 23:30:34,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:34,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 23:30:34,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [442981564] [2019-12-27 23:30:34,458 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:34,464 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:34,481 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 139 transitions. [2019-12-27 23:30:34,482 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:34,483 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 23:30:34,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:30:34,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:34,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:30:34,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:30:34,484 INFO L87 Difference]: Start difference. First operand 36093 states and 150964 transitions. Second operand 10 states. [2019-12-27 23:30:35,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:35,315 INFO L93 Difference]: Finished difference Result 42962 states and 180318 transitions. [2019-12-27 23:30:35,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:30:35,315 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-12-27 23:30:35,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:35,419 INFO L225 Difference]: With dead ends: 42962 [2019-12-27 23:30:35,420 INFO L226 Difference]: Without dead ends: 42716 [2019-12-27 23:30:35,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 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-12-27 23:30:35,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42716 states. [2019-12-27 23:30:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42716 to 39089. [2019-12-27 23:30:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39089 states. [2019-12-27 23:30:36,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39089 states to 39089 states and 165489 transitions. [2019-12-27 23:30:36,559 INFO L78 Accepts]: Start accepts. Automaton has 39089 states and 165489 transitions. Word has length 45 [2019-12-27 23:30:36,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:36,559 INFO L462 AbstractCegarLoop]: Abstraction has 39089 states and 165489 transitions. [2019-12-27 23:30:36,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:30:36,560 INFO L276 IsEmpty]: Start isEmpty. Operand 39089 states and 165489 transitions. [2019-12-27 23:30:36,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 23:30:36,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:36,573 INFO L411 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-12-27 23:30:36,574 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-12-27 23:30:36,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:36,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1972664708, now seen corresponding path program 4 times [2019-12-27 23:30:36,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:36,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691686614] [2019-12-27 23:30:36,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:36,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691686614] [2019-12-27 23:30:36,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:36,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 23:30:36,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [476512487] [2019-12-27 23:30:36,755 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:36,759 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:36,772 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 145 transitions. [2019-12-27 23:30:36,772 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:36,785 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:30:36,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:30:36,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:36,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:30:36,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:30:36,787 INFO L87 Difference]: Start difference. First operand 39089 states and 165489 transitions. Second operand 13 states. [2019-12-27 23:30:37,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:37,571 INFO L93 Difference]: Finished difference Result 45942 states and 194801 transitions. [2019-12-27 23:30:37,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:30:37,572 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2019-12-27 23:30:37,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:37,686 INFO L225 Difference]: With dead ends: 45942 [2019-12-27 23:30:37,686 INFO L226 Difference]: Without dead ends: 45696 [2019-12-27 23:30:37,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2019-12-27 23:30:38,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45696 states. [2019-12-27 23:30:38,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45696 to 39079. [2019-12-27 23:30:38,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39079 states. [2019-12-27 23:30:38,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39079 states to 39079 states and 165461 transitions. [2019-12-27 23:30:38,903 INFO L78 Accepts]: Start accepts. Automaton has 39079 states and 165461 transitions. Word has length 45 [2019-12-27 23:30:38,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:38,903 INFO L462 AbstractCegarLoop]: Abstraction has 39079 states and 165461 transitions. [2019-12-27 23:30:38,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:30:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand 39079 states and 165461 transitions. [2019-12-27 23:30:38,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 23:30:38,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:38,918 INFO L411 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-12-27 23:30:38,918 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-12-27 23:30:38,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:38,918 INFO L82 PathProgramCache]: Analyzing trace with hash -237289220, now seen corresponding path program 5 times [2019-12-27 23:30:38,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:38,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652290335] [2019-12-27 23:30:38,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:39,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:39,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652290335] [2019-12-27 23:30:39,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:39,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 23:30:39,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [793733085] [2019-12-27 23:30:39,340 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:39,348 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:39,369 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 151 transitions. [2019-12-27 23:30:39,370 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:39,381 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:30:39,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 23:30:39,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:39,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 23:30:39,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:30:39,386 INFO L87 Difference]: Start difference. First operand 39079 states and 165461 transitions. Second operand 15 states. [2019-12-27 23:30:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:41,249 INFO L93 Difference]: Finished difference Result 48739 states and 207928 transitions. [2019-12-27 23:30:41,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:30:41,250 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2019-12-27 23:30:41,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:41,374 INFO L225 Difference]: With dead ends: 48739 [2019-12-27 23:30:41,374 INFO L226 Difference]: Without dead ends: 48547 [2019-12-27 23:30:41,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 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-12-27 23:30:41,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48547 states. [2019-12-27 23:30:42,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48547 to 39029. [2019-12-27 23:30:42,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39029 states. [2019-12-27 23:30:42,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39029 states to 39029 states and 165325 transitions. [2019-12-27 23:30:42,199 INFO L78 Accepts]: Start accepts. Automaton has 39029 states and 165325 transitions. Word has length 45 [2019-12-27 23:30:42,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:42,201 INFO L462 AbstractCegarLoop]: Abstraction has 39029 states and 165325 transitions. [2019-12-27 23:30:42,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 23:30:42,201 INFO L276 IsEmpty]: Start isEmpty. Operand 39029 states and 165325 transitions. [2019-12-27 23:30:42,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 23:30:42,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:42,221 INFO L411 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-12-27 23:30:42,221 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-12-27 23:30:42,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:42,221 INFO L82 PathProgramCache]: Analyzing trace with hash -237203330, now seen corresponding path program 1 times [2019-12-27 23:30:42,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:42,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089706909] [2019-12-27 23:30:42,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:42,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089706909] [2019-12-27 23:30:42,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:42,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 23:30:42,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [497391119] [2019-12-27 23:30:42,357 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:42,365 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:42,621 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 116 states and 195 transitions. [2019-12-27 23:30:42,621 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:42,635 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:30:42,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:30:42,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:42,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:30:42,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:30:42,636 INFO L87 Difference]: Start difference. First operand 39029 states and 165325 transitions. Second operand 11 states. [2019-12-27 23:30:43,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:43,210 INFO L93 Difference]: Finished difference Result 44984 states and 189481 transitions. [2019-12-27 23:30:43,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:30:43,211 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2019-12-27 23:30:43,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:43,318 INFO L225 Difference]: With dead ends: 44984 [2019-12-27 23:30:43,318 INFO L226 Difference]: Without dead ends: 44678 [2019-12-27 23:30:43,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:30:43,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44678 states. [2019-12-27 23:30:44,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44678 to 39018. [2019-12-27 23:30:44,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39018 states. [2019-12-27 23:30:44,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39018 states to 39018 states and 165302 transitions. [2019-12-27 23:30:44,112 INFO L78 Accepts]: Start accepts. Automaton has 39018 states and 165302 transitions. Word has length 47 [2019-12-27 23:30:44,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:44,112 INFO L462 AbstractCegarLoop]: Abstraction has 39018 states and 165302 transitions. [2019-12-27 23:30:44,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:30:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 39018 states and 165302 transitions. [2019-12-27 23:30:44,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 23:30:44,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:44,133 INFO L411 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-12-27 23:30:44,133 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-12-27 23:30:44,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:44,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1279105862, now seen corresponding path program 2 times [2019-12-27 23:30:44,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:44,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318572778] [2019-12-27 23:30:44,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:44,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318572778] [2019-12-27 23:30:44,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:44,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 23:30:44,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1571890115] [2019-12-27 23:30:44,850 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:44,856 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:44,877 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 131 states and 237 transitions. [2019-12-27 23:30:44,878 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:44,882 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:30:44,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 23:30:44,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:44,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 23:30:44,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:30:44,883 INFO L87 Difference]: Start difference. First operand 39018 states and 165302 transitions. Second operand 14 states. [2019-12-27 23:30:45,727 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-12-27 23:30:46,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:46,471 INFO L93 Difference]: Finished difference Result 47732 states and 200591 transitions. [2019-12-27 23:30:46,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:30:46,472 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2019-12-27 23:30:46,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:46,588 INFO L225 Difference]: With dead ends: 47732 [2019-12-27 23:30:46,588 INFO L226 Difference]: Without dead ends: 47426 [2019-12-27 23:30:46,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 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-12-27 23:30:46,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47426 states. [2019-12-27 23:30:47,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47426 to 37958. [2019-12-27 23:30:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37958 states. [2019-12-27 23:30:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37958 states to 37958 states and 160183 transitions. [2019-12-27 23:30:47,924 INFO L78 Accepts]: Start accepts. Automaton has 37958 states and 160183 transitions. Word has length 47 [2019-12-27 23:30:47,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:47,924 INFO L462 AbstractCegarLoop]: Abstraction has 37958 states and 160183 transitions. [2019-12-27 23:30:47,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 23:30:47,925 INFO L276 IsEmpty]: Start isEmpty. Operand 37958 states and 160183 transitions. [2019-12-27 23:30:47,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 23:30:47,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:47,946 INFO L411 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-12-27 23:30:47,946 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-12-27 23:30:47,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:47,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1755610754, now seen corresponding path program 1 times [2019-12-27 23:30:47,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:47,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118631080] [2019-12-27 23:30:47,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:48,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:48,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118631080] [2019-12-27 23:30:48,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:48,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 23:30:48,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1629344617] [2019-12-27 23:30:48,111 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:48,118 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:48,141 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 217 transitions. [2019-12-27 23:30:48,142 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:48,144 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 23:30:48,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:30:48,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:48,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:30:48,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:30:48,145 INFO L87 Difference]: Start difference. First operand 37958 states and 160183 transitions. Second operand 12 states. [2019-12-27 23:30:48,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:48,950 INFO L93 Difference]: Finished difference Result 54466 states and 223015 transitions. [2019-12-27 23:30:48,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:30:48,951 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2019-12-27 23:30:48,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:49,066 INFO L225 Difference]: With dead ends: 54466 [2019-12-27 23:30:49,066 INFO L226 Difference]: Without dead ends: 47822 [2019-12-27 23:30:49,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 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-12-27 23:30:49,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47822 states. [2019-12-27 23:30:49,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47822 to 37752. [2019-12-27 23:30:49,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37752 states. [2019-12-27 23:30:50,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37752 states to 37752 states and 159365 transitions. [2019-12-27 23:30:50,562 INFO L78 Accepts]: Start accepts. Automaton has 37752 states and 159365 transitions. Word has length 47 [2019-12-27 23:30:50,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:50,563 INFO L462 AbstractCegarLoop]: Abstraction has 37752 states and 159365 transitions. [2019-12-27 23:30:50,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:30:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 37752 states and 159365 transitions. [2019-12-27 23:30:50,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 23:30:50,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:50,582 INFO L411 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-12-27 23:30:50,582 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-12-27 23:30:50,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:50,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1197832933, now seen corresponding path program 1 times [2019-12-27 23:30:50,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:50,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023144094] [2019-12-27 23:30:50,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:50,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:50,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023144094] [2019-12-27 23:30:50,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:50,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 23:30:50,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1860546903] [2019-12-27 23:30:50,933 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:50,940 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:50,964 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 161 transitions. [2019-12-27 23:30:50,964 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:50,980 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:30:50,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 23:30:50,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:50,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 23:30:50,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:30:50,982 INFO L87 Difference]: Start difference. First operand 37752 states and 159365 transitions. Second operand 15 states. [2019-12-27 23:30:52,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:52,266 INFO L93 Difference]: Finished difference Result 39913 states and 166616 transitions. [2019-12-27 23:30:52,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:30:52,266 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-12-27 23:30:52,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:52,368 INFO L225 Difference]: With dead ends: 39913 [2019-12-27 23:30:52,368 INFO L226 Difference]: Without dead ends: 39607 [2019-12-27 23:30:52,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:30:52,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39607 states. [2019-12-27 23:30:53,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39607 to 35601. [2019-12-27 23:30:53,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35601 states. [2019-12-27 23:30:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35601 states to 35601 states and 149339 transitions. [2019-12-27 23:30:53,100 INFO L78 Accepts]: Start accepts. Automaton has 35601 states and 149339 transitions. Word has length 47 [2019-12-27 23:30:53,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:53,100 INFO L462 AbstractCegarLoop]: Abstraction has 35601 states and 149339 transitions. [2019-12-27 23:30:53,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 23:30:53,101 INFO L276 IsEmpty]: Start isEmpty. Operand 35601 states and 149339 transitions. [2019-12-27 23:30:53,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 23:30:53,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:53,115 INFO L411 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-12-27 23:30:53,115 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-12-27 23:30:53,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:53,115 INFO L82 PathProgramCache]: Analyzing trace with hash 2013384893, now seen corresponding path program 1 times [2019-12-27 23:30:53,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:53,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160023838] [2019-12-27 23:30:53,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:53,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:53,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160023838] [2019-12-27 23:30:53,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:53,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 23:30:53,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1913973940] [2019-12-27 23:30:53,808 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:53,815 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:53,836 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 187 transitions. [2019-12-27 23:30:53,836 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:53,839 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:30:53,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 23:30:53,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:53,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 23:30:53,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:30:53,840 INFO L87 Difference]: Start difference. First operand 35601 states and 149339 transitions. Second operand 16 states. [2019-12-27 23:30:54,806 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-12-27 23:30:55,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:55,789 INFO L93 Difference]: Finished difference Result 45102 states and 190564 transitions. [2019-12-27 23:30:55,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:30:55,790 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2019-12-27 23:30:55,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:55,908 INFO L225 Difference]: With dead ends: 45102 [2019-12-27 23:30:55,908 INFO L226 Difference]: Without dead ends: 44856 [2019-12-27 23:30:55,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2019-12-27 23:30:56,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44856 states. [2019-12-27 23:30:56,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44856 to 37548. [2019-12-27 23:30:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37548 states. [2019-12-27 23:30:57,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37548 states to 37548 states and 159873 transitions. [2019-12-27 23:30:57,238 INFO L78 Accepts]: Start accepts. Automaton has 37548 states and 159873 transitions. Word has length 47 [2019-12-27 23:30:57,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:57,238 INFO L462 AbstractCegarLoop]: Abstraction has 37548 states and 159873 transitions. [2019-12-27 23:30:57,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 23:30:57,238 INFO L276 IsEmpty]: Start isEmpty. Operand 37548 states and 159873 transitions. [2019-12-27 23:30:57,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-27 23:30:57,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:57,261 INFO L411 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-12-27 23:30:57,262 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-12-27 23:30:57,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:57,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1496907519, now seen corresponding path program 1 times [2019-12-27 23:30:57,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:57,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562660626] [2019-12-27 23:30:57,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:57,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:57,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562660626] [2019-12-27 23:30:57,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:57,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 23:30:57,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1440033503] [2019-12-27 23:30:57,779 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:57,786 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:57,833 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 146 states and 281 transitions. [2019-12-27 23:30:57,833 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:57,838 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 23:30:57,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 23:30:57,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:57,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 23:30:57,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:30:57,840 INFO L87 Difference]: Start difference. First operand 37548 states and 159873 transitions. Second operand 16 states. [2019-12-27 23:30:58,663 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-12-27 23:30:59,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:59,613 INFO L93 Difference]: Finished difference Result 42944 states and 180663 transitions. [2019-12-27 23:30:59,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:30:59,614 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2019-12-27 23:30:59,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:59,716 INFO L225 Difference]: With dead ends: 42944 [2019-12-27 23:30:59,717 INFO L226 Difference]: Without dead ends: 42638 [2019-12-27 23:30:59,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2019-12-27 23:30:59,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42638 states. [2019-12-27 23:31:00,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42638 to 34161. [2019-12-27 23:31:00,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34161 states. [2019-12-27 23:31:01,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34161 states to 34161 states and 144013 transitions. [2019-12-27 23:31:01,012 INFO L78 Accepts]: Start accepts. Automaton has 34161 states and 144013 transitions. Word has length 49 [2019-12-27 23:31:01,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:01,012 INFO L462 AbstractCegarLoop]: Abstraction has 34161 states and 144013 transitions. [2019-12-27 23:31:01,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 23:31:01,012 INFO L276 IsEmpty]: Start isEmpty. Operand 34161 states and 144013 transitions. [2019-12-27 23:31:01,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 23:31:01,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:01,035 INFO L411 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-12-27 23:31:01,035 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-12-27 23:31:01,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:01,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1847573331, now seen corresponding path program 1 times [2019-12-27 23:31:01,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:01,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111636408] [2019-12-27 23:31:01,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:01,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:01,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111636408] [2019-12-27 23:31:01,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:01,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:31:01,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1978892743] [2019-12-27 23:31:01,090 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:01,102 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:01,121 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 120 transitions. [2019-12-27 23:31:01,122 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:01,164 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 23:31:01,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:31:01,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:01,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:31:01,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:31:01,166 INFO L87 Difference]: Start difference. First operand 34161 states and 144013 transitions. Second operand 7 states. [2019-12-27 23:31:01,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:01,676 INFO L93 Difference]: Finished difference Result 38902 states and 161891 transitions. [2019-12-27 23:31:01,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:31:01,677 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-27 23:31:01,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:01,835 INFO L225 Difference]: With dead ends: 38902 [2019-12-27 23:31:01,835 INFO L226 Difference]: Without dead ends: 38068 [2019-12-27 23:31:01,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:31:02,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38068 states. [2019-12-27 23:31:02,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38068 to 36250. [2019-12-27 23:31:02,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36250 states. [2019-12-27 23:31:02,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36250 states to 36250 states and 152433 transitions. [2019-12-27 23:31:02,617 INFO L78 Accepts]: Start accepts. Automaton has 36250 states and 152433 transitions. Word has length 50 [2019-12-27 23:31:02,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:02,617 INFO L462 AbstractCegarLoop]: Abstraction has 36250 states and 152433 transitions. [2019-12-27 23:31:02,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:31:02,617 INFO L276 IsEmpty]: Start isEmpty. Operand 36250 states and 152433 transitions. [2019-12-27 23:31:02,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 23:31:02,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:02,647 INFO L411 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-12-27 23:31:02,648 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-12-27 23:31:02,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:02,648 INFO L82 PathProgramCache]: Analyzing trace with hash 85080083, now seen corresponding path program 2 times [2019-12-27 23:31:02,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:02,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680624295] [2019-12-27 23:31:02,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:02,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-12-27 23:31:02,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680624295] [2019-12-27 23:31:02,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:02,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 23:31:02,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1680662425] [2019-12-27 23:31:02,721 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:02,728 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:02,758 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 210 transitions. [2019-12-27 23:31:02,759 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:02,799 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 23:31:02,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:31:02,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:02,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:31:02,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:31:02,800 INFO L87 Difference]: Start difference. First operand 36250 states and 152433 transitions. Second operand 9 states. [2019-12-27 23:31:03,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:03,263 INFO L93 Difference]: Finished difference Result 40970 states and 170279 transitions. [2019-12-27 23:31:03,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 23:31:03,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-12-27 23:31:03,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:03,707 INFO L225 Difference]: With dead ends: 40970 [2019-12-27 23:31:03,707 INFO L226 Difference]: Without dead ends: 40136 [2019-12-27 23:31:03,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:31:03,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40136 states. [2019-12-27 23:31:04,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40136 to 36229. [2019-12-27 23:31:04,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36229 states. [2019-12-27 23:31:04,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36229 states to 36229 states and 152401 transitions. [2019-12-27 23:31:04,428 INFO L78 Accepts]: Start accepts. Automaton has 36229 states and 152401 transitions. Word has length 50 [2019-12-27 23:31:04,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:04,428 INFO L462 AbstractCegarLoop]: Abstraction has 36229 states and 152401 transitions. [2019-12-27 23:31:04,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:31:04,428 INFO L276 IsEmpty]: Start isEmpty. Operand 36229 states and 152401 transitions. [2019-12-27 23:31:04,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 23:31:04,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:04,450 INFO L411 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-12-27 23:31:04,450 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-12-27 23:31:04,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:04,451 INFO L82 PathProgramCache]: Analyzing trace with hash 368089865, now seen corresponding path program 3 times [2019-12-27 23:31:04,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:04,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488086132] [2019-12-27 23:31:04,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:04,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:04,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488086132] [2019-12-27 23:31:04,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:04,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 23:31:04,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1268947692] [2019-12-27 23:31:04,599 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:04,604 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:04,623 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 170 transitions. [2019-12-27 23:31:04,623 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:04,625 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:31:04,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:31:04,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:04,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:31:04,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:31:04,625 INFO L87 Difference]: Start difference. First operand 36229 states and 152401 transitions. Second operand 10 states. [2019-12-27 23:31:05,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:05,353 INFO L93 Difference]: Finished difference Result 40944 states and 170238 transitions. [2019-12-27 23:31:05,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:31:05,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-12-27 23:31:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:05,453 INFO L225 Difference]: With dead ends: 40944 [2019-12-27 23:31:05,453 INFO L226 Difference]: Without dead ends: 40110 [2019-12-27 23:31:05,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:31:05,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40110 states. [2019-12-27 23:31:06,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40110 to 36224. [2019-12-27 23:31:06,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36224 states. [2019-12-27 23:31:06,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36224 states to 36224 states and 152392 transitions. [2019-12-27 23:31:06,599 INFO L78 Accepts]: Start accepts. Automaton has 36224 states and 152392 transitions. Word has length 50 [2019-12-27 23:31:06,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:06,600 INFO L462 AbstractCegarLoop]: Abstraction has 36224 states and 152392 transitions. [2019-12-27 23:31:06,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:31:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 36224 states and 152392 transitions. [2019-12-27 23:31:06,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 23:31:06,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:06,620 INFO L411 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-12-27 23:31:06,621 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-12-27 23:31:06,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:06,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1194704651, now seen corresponding path program 1 times [2019-12-27 23:31:06,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:06,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082155052] [2019-12-27 23:31:06,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:06,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:06,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082155052] [2019-12-27 23:31:06,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:06,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 23:31:06,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1100125764] [2019-12-27 23:31:06,805 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:06,809 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:06,837 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 140 states and 256 transitions. [2019-12-27 23:31:06,840 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:06,844 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 23:31:06,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 23:31:06,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:06,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 23:31:06,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:31:06,847 INFO L87 Difference]: Start difference. First operand 36224 states and 152392 transitions. Second operand 14 states. [2019-12-27 23:31:07,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:07,775 INFO L93 Difference]: Finished difference Result 55813 states and 227527 transitions. [2019-12-27 23:31:07,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:31:07,776 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2019-12-27 23:31:07,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:07,876 INFO L225 Difference]: With dead ends: 55813 [2019-12-27 23:31:07,876 INFO L226 Difference]: Without dead ends: 41645 [2019-12-27 23:31:07,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 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-12-27 23:31:08,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41645 states. [2019-12-27 23:31:08,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41645 to 31645. [2019-12-27 23:31:08,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31645 states. [2019-12-27 23:31:08,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31645 states to 31645 states and 132063 transitions. [2019-12-27 23:31:08,561 INFO L78 Accepts]: Start accepts. Automaton has 31645 states and 132063 transitions. Word has length 50 [2019-12-27 23:31:08,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:08,561 INFO L462 AbstractCegarLoop]: Abstraction has 31645 states and 132063 transitions. [2019-12-27 23:31:08,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 23:31:08,561 INFO L276 IsEmpty]: Start isEmpty. Operand 31645 states and 132063 transitions. [2019-12-27 23:31:08,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 23:31:08,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:08,581 INFO L411 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-12-27 23:31:08,581 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-12-27 23:31:08,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:08,582 INFO L82 PathProgramCache]: Analyzing trace with hash 557019397, now seen corresponding path program 4 times [2019-12-27 23:31:08,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:08,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653700497] [2019-12-27 23:31:08,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:08,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:08,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653700497] [2019-12-27 23:31:08,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:08,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 23:31:08,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [150053506] [2019-12-27 23:31:08,793 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:08,801 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:08,834 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 113 states and 186 transitions. [2019-12-27 23:31:08,834 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:08,836 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:31:08,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:31:08,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:08,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:31:08,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:31:08,837 INFO L87 Difference]: Start difference. First operand 31645 states and 132063 transitions. Second operand 12 states. [2019-12-27 23:31:10,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:10,182 INFO L93 Difference]: Finished difference Result 35903 states and 148202 transitions. [2019-12-27 23:31:10,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:31:10,183 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-12-27 23:31:10,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:10,310 INFO L225 Difference]: With dead ends: 35903 [2019-12-27 23:31:10,310 INFO L226 Difference]: Without dead ends: 35264 [2019-12-27 23:31:10,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 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-12-27 23:31:10,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35264 states. [2019-12-27 23:31:10,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35264 to 31635. [2019-12-27 23:31:10,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31635 states. [2019-12-27 23:31:11,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31635 states to 31635 states and 132039 transitions. [2019-12-27 23:31:11,031 INFO L78 Accepts]: Start accepts. Automaton has 31635 states and 132039 transitions. Word has length 50 [2019-12-27 23:31:11,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:11,032 INFO L462 AbstractCegarLoop]: Abstraction has 31635 states and 132039 transitions. [2019-12-27 23:31:11,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:31:11,032 INFO L276 IsEmpty]: Start isEmpty. Operand 31635 states and 132039 transitions. [2019-12-27 23:31:11,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 23:31:11,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:11,053 INFO L411 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-12-27 23:31:11,053 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-12-27 23:31:11,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:11,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1504475862, now seen corresponding path program 1 times [2019-12-27 23:31:11,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:11,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464744376] [2019-12-27 23:31:11,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:11,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464744376] [2019-12-27 23:31:11,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:11,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 23:31:11,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1523011578] [2019-12-27 23:31:11,826 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:11,833 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:11,866 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 226 transitions. [2019-12-27 23:31:11,867 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:11,871 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 23:31:11,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 23:31:11,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:11,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 23:31:11,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:31:11,873 INFO L87 Difference]: Start difference. First operand 31635 states and 132039 transitions. Second operand 18 states. [2019-12-27 23:31:12,968 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-12-27 23:31:14,355 WARN L192 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-12-27 23:31:14,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:14,763 INFO L93 Difference]: Finished difference Result 34237 states and 140880 transitions. [2019-12-27 23:31:14,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 23:31:14,763 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2019-12-27 23:31:14,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:14,846 INFO L225 Difference]: With dead ends: 34237 [2019-12-27 23:31:14,846 INFO L226 Difference]: Without dead ends: 33415 [2019-12-27 23:31:14,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=332, Invalid=1074, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 23:31:14,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33415 states. [2019-12-27 23:31:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33415 to 26641. [2019-12-27 23:31:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26641 states. [2019-12-27 23:31:15,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26641 states to 26641 states and 110388 transitions. [2019-12-27 23:31:15,383 INFO L78 Accepts]: Start accepts. Automaton has 26641 states and 110388 transitions. Word has length 50 [2019-12-27 23:31:15,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:15,383 INFO L462 AbstractCegarLoop]: Abstraction has 26641 states and 110388 transitions. [2019-12-27 23:31:15,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 23:31:15,384 INFO L276 IsEmpty]: Start isEmpty. Operand 26641 states and 110388 transitions. [2019-12-27 23:31:15,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 23:31:15,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:15,401 INFO L411 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-12-27 23:31:15,401 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-12-27 23:31:15,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:15,402 INFO L82 PathProgramCache]: Analyzing trace with hash 238485273, now seen corresponding path program 5 times [2019-12-27 23:31:15,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:15,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361265547] [2019-12-27 23:31:15,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:15,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:15,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361265547] [2019-12-27 23:31:15,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:15,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 23:31:15,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [358701047] [2019-12-27 23:31:15,978 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:15,986 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:16,022 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 211 transitions. [2019-12-27 23:31:16,022 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:16,026 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 23:31:16,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 23:31:16,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:16,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 23:31:16,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:31:16,028 INFO L87 Difference]: Start difference. First operand 26641 states and 110388 transitions. Second operand 16 states. [2019-12-27 23:31:17,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:17,113 INFO L93 Difference]: Finished difference Result 30874 states and 126473 transitions. [2019-12-27 23:31:17,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:31:17,113 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2019-12-27 23:31:17,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:17,186 INFO L225 Difference]: With dead ends: 30874 [2019-12-27 23:31:17,186 INFO L226 Difference]: Without dead ends: 30235 [2019-12-27 23:31:17,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-12-27 23:31:17,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30235 states. [2019-12-27 23:31:17,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30235 to 26641. [2019-12-27 23:31:17,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26641 states. [2019-12-27 23:31:17,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26641 states to 26641 states and 110298 transitions. [2019-12-27 23:31:17,743 INFO L78 Accepts]: Start accepts. Automaton has 26641 states and 110298 transitions. Word has length 50 [2019-12-27 23:31:17,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:17,743 INFO L462 AbstractCegarLoop]: Abstraction has 26641 states and 110298 transitions. [2019-12-27 23:31:17,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 23:31:17,743 INFO L276 IsEmpty]: Start isEmpty. Operand 26641 states and 110298 transitions. [2019-12-27 23:31:17,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 23:31:17,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:17,761 INFO L411 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-12-27 23:31:17,762 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-12-27 23:31:17,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:17,762 INFO L82 PathProgramCache]: Analyzing trace with hash -467336723, now seen corresponding path program 6 times [2019-12-27 23:31:17,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:17,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428993264] [2019-12-27 23:31:17,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:18,106 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-12-27 23:31:18,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:18,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428993264] [2019-12-27 23:31:18,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:18,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 23:31:18,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1886374492] [2019-12-27 23:31:18,207 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:18,219 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:18,258 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 204 transitions. [2019-12-27 23:31:18,258 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:18,278 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:31:18,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 23:31:18,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:18,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 23:31:18,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:31:18,279 INFO L87 Difference]: Start difference. First operand 26641 states and 110298 transitions. Second operand 15 states. [2019-12-27 23:31:19,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:19,007 INFO L93 Difference]: Finished difference Result 32166 states and 131397 transitions. [2019-12-27 23:31:19,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:31:19,007 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2019-12-27 23:31:19,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:19,087 INFO L225 Difference]: With dead ends: 32166 [2019-12-27 23:31:19,088 INFO L226 Difference]: Without dead ends: 31527 [2019-12-27 23:31:19,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=517, Unknown=0, NotChecked=0, Total=702 [2019-12-27 23:31:19,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31527 states. [2019-12-27 23:31:19,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31527 to 26069. [2019-12-27 23:31:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26069 states. [2019-12-27 23:31:19,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26069 states to 26069 states and 107734 transitions. [2019-12-27 23:31:19,647 INFO L78 Accepts]: Start accepts. Automaton has 26069 states and 107734 transitions. Word has length 50 [2019-12-27 23:31:19,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:19,647 INFO L462 AbstractCegarLoop]: Abstraction has 26069 states and 107734 transitions. [2019-12-27 23:31:19,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 23:31:19,647 INFO L276 IsEmpty]: Start isEmpty. Operand 26069 states and 107734 transitions. [2019-12-27 23:31:19,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 23:31:19,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:19,672 INFO L411 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-12-27 23:31:19,672 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-12-27 23:31:19,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:19,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1790589462, now seen corresponding path program 1 times [2019-12-27 23:31:19,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:19,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344604205] [2019-12-27 23:31:19,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:20,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:20,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344604205] [2019-12-27 23:31:20,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:20,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 23:31:20,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [138833559] [2019-12-27 23:31:20,309 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:20,314 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:20,365 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 320 transitions. [2019-12-27 23:31:20,366 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:20,370 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 23:31:20,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 23:31:20,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:20,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 23:31:20,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:31:20,371 INFO L87 Difference]: Start difference. First operand 26069 states and 107734 transitions. Second operand 18 states. [2019-12-27 23:31:21,615 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-12-27 23:31:22,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:22,977 INFO L93 Difference]: Finished difference Result 26868 states and 109219 transitions. [2019-12-27 23:31:22,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 23:31:22,977 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-12-27 23:31:22,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:23,043 INFO L225 Difference]: With dead ends: 26868 [2019-12-27 23:31:23,043 INFO L226 Difference]: Without dead ends: 25824 [2019-12-27 23:31:23,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 25 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-12-27 23:31:23,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25824 states. [2019-12-27 23:31:23,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25824 to 20400. [2019-12-27 23:31:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20400 states. [2019-12-27 23:31:23,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20400 states to 20400 states and 83216 transitions. [2019-12-27 23:31:23,705 INFO L78 Accepts]: Start accepts. Automaton has 20400 states and 83216 transitions. Word has length 52 [2019-12-27 23:31:23,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:23,706 INFO L462 AbstractCegarLoop]: Abstraction has 20400 states and 83216 transitions. [2019-12-27 23:31:23,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 23:31:23,706 INFO L276 IsEmpty]: Start isEmpty. Operand 20400 states and 83216 transitions. [2019-12-27 23:31:23,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 23:31:23,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:23,723 INFO L411 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-12-27 23:31:23,723 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-12-27 23:31:23,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:23,724 INFO L82 PathProgramCache]: Analyzing trace with hash 610346052, now seen corresponding path program 1 times [2019-12-27 23:31:23,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:23,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867936990] [2019-12-27 23:31:23,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:24,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867936990] [2019-12-27 23:31:24,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:24,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 23:31:24,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2099268973] [2019-12-27 23:31:24,196 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:24,201 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:24,232 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 202 transitions. [2019-12-27 23:31:24,232 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:24,235 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:31:24,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 23:31:24,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:24,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 23:31:24,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:31:24,236 INFO L87 Difference]: Start difference. First operand 20400 states and 83216 transitions. Second operand 14 states. [2019-12-27 23:31:25,484 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-12-27 23:31:25,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:25,916 INFO L93 Difference]: Finished difference Result 25840 states and 104248 transitions. [2019-12-27 23:31:25,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 23:31:25,916 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2019-12-27 23:31:25,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:25,974 INFO L225 Difference]: With dead ends: 25840 [2019-12-27 23:31:25,974 INFO L226 Difference]: Without dead ends: 25471 [2019-12-27 23:31:25,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 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-12-27 23:31:26,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25471 states. [2019-12-27 23:31:26,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25471 to 20430. [2019-12-27 23:31:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20430 states. [2019-12-27 23:31:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20430 states to 20430 states and 83308 transitions. [2019-12-27 23:31:26,381 INFO L78 Accepts]: Start accepts. Automaton has 20430 states and 83308 transitions. Word has length 52 [2019-12-27 23:31:26,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:26,381 INFO L462 AbstractCegarLoop]: Abstraction has 20430 states and 83308 transitions. [2019-12-27 23:31:26,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 23:31:26,381 INFO L276 IsEmpty]: Start isEmpty. Operand 20430 states and 83308 transitions. [2019-12-27 23:31:26,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 23:31:26,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:26,398 INFO L411 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-12-27 23:31:26,398 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-12-27 23:31:26,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:26,399 INFO L82 PathProgramCache]: Analyzing trace with hash -414010068, now seen corresponding path program 2 times [2019-12-27 23:31:26,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:26,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055080588] [2019-12-27 23:31:26,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:26,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055080588] [2019-12-27 23:31:26,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:26,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 23:31:26,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1893861410] [2019-12-27 23:31:26,840 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:26,851 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:26,902 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 220 transitions. [2019-12-27 23:31:26,902 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:26,935 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 23:31:26,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 23:31:26,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:26,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 23:31:26,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:31:26,937 INFO L87 Difference]: Start difference. First operand 20430 states and 83308 transitions. Second operand 17 states. [2019-12-27 23:31:28,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:28,996 INFO L93 Difference]: Finished difference Result 23475 states and 94872 transitions. [2019-12-27 23:31:28,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 23:31:28,997 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2019-12-27 23:31:28,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:29,058 INFO L225 Difference]: With dead ends: 23475 [2019-12-27 23:31:29,058 INFO L226 Difference]: Without dead ends: 23106 [2019-12-27 23:31:29,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=258, Invalid=798, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 23:31:29,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23106 states. [2019-12-27 23:31:29,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23106 to 20091. [2019-12-27 23:31:29,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20091 states. [2019-12-27 23:31:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20091 states to 20091 states and 82206 transitions. [2019-12-27 23:31:29,436 INFO L78 Accepts]: Start accepts. Automaton has 20091 states and 82206 transitions. Word has length 52 [2019-12-27 23:31:29,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:29,436 INFO L462 AbstractCegarLoop]: Abstraction has 20091 states and 82206 transitions. [2019-12-27 23:31:29,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 23:31:29,436 INFO L276 IsEmpty]: Start isEmpty. Operand 20091 states and 82206 transitions. [2019-12-27 23:31:29,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 23:31:29,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:29,453 INFO L411 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-12-27 23:31:29,453 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-12-27 23:31:29,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:29,454 INFO L82 PathProgramCache]: Analyzing trace with hash -650142920, now seen corresponding path program 1 times [2019-12-27 23:31:29,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:29,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130131878] [2019-12-27 23:31:29,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:30,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:30,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130131878] [2019-12-27 23:31:30,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:30,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 23:31:30,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [91786171] [2019-12-27 23:31:30,039 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:30,044 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:30,089 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 299 transitions. [2019-12-27 23:31:30,089 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:30,093 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 23:31:30,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 23:31:30,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:30,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 23:31:30,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:31:30,094 INFO L87 Difference]: Start difference. First operand 20091 states and 82206 transitions. Second operand 18 states. [2019-12-27 23:31:31,014 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-12-27 23:31:31,173 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-12-27 23:31:31,293 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-12-27 23:31:31,421 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-12-27 23:31:31,585 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-12-27 23:31:32,360 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-12-27 23:31:32,591 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-12-27 23:31:33,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:33,204 INFO L93 Difference]: Finished difference Result 20593 states and 82993 transitions. [2019-12-27 23:31:33,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:31:33,205 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-12-27 23:31:33,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:33,251 INFO L225 Difference]: With dead ends: 20593 [2019-12-27 23:31:33,251 INFO L226 Difference]: Without dead ends: 18658 [2019-12-27 23:31:33,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=383, Invalid=1257, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 23:31:33,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18658 states. [2019-12-27 23:31:33,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18658 to 12962. [2019-12-27 23:31:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12962 states. [2019-12-27 23:31:33,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12962 states to 12962 states and 52687 transitions. [2019-12-27 23:31:33,532 INFO L78 Accepts]: Start accepts. Automaton has 12962 states and 52687 transitions. Word has length 52 [2019-12-27 23:31:33,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:33,532 INFO L462 AbstractCegarLoop]: Abstraction has 12962 states and 52687 transitions. [2019-12-27 23:31:33,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 23:31:33,532 INFO L276 IsEmpty]: Start isEmpty. Operand 12962 states and 52687 transitions. [2019-12-27 23:31:33,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 23:31:33,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:33,545 INFO L411 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-12-27 23:31:33,545 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-12-27 23:31:33,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:33,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1885292943, now seen corresponding path program 1 times [2019-12-27 23:31:33,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:33,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453773213] [2019-12-27 23:31:33,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:33,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:33,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453773213] [2019-12-27 23:31:33,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:33,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:31:33,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [469405964] [2019-12-27 23:31:33,605 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:33,611 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:33,635 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 92 states and 129 transitions. [2019-12-27 23:31:33,635 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:33,679 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:31:33,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:31:33,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:33,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:31:33,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:31:33,680 INFO L87 Difference]: Start difference. First operand 12962 states and 52687 transitions. Second operand 7 states. [2019-12-27 23:31:33,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:33,993 INFO L93 Difference]: Finished difference Result 15975 states and 63018 transitions. [2019-12-27 23:31:33,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:31:33,993 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 23:31:33,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:34,058 INFO L225 Difference]: With dead ends: 15975 [2019-12-27 23:31:34,059 INFO L226 Difference]: Without dead ends: 15255 [2019-12-27 23:31:34,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:31:34,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15255 states. [2019-12-27 23:31:34,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15255 to 14835. [2019-12-27 23:31:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14835 states. [2019-12-27 23:31:34,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14835 states to 14835 states and 59421 transitions. [2019-12-27 23:31:34,685 INFO L78 Accepts]: Start accepts. Automaton has 14835 states and 59421 transitions. Word has length 53 [2019-12-27 23:31:34,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:34,685 INFO L462 AbstractCegarLoop]: Abstraction has 14835 states and 59421 transitions. [2019-12-27 23:31:34,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:31:34,686 INFO L276 IsEmpty]: Start isEmpty. Operand 14835 states and 59421 transitions. [2019-12-27 23:31:34,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 23:31:34,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:34,704 INFO L411 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-12-27 23:31:34,704 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-12-27 23:31:34,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:34,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1948516785, now seen corresponding path program 2 times [2019-12-27 23:31:34,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:34,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980031676] [2019-12-27 23:31:34,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:34,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980031676] [2019-12-27 23:31:34,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:34,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 23:31:34,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [278787853] [2019-12-27 23:31:34,794 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:34,799 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:34,836 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 127 states and 219 transitions. [2019-12-27 23:31:34,836 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:34,860 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:31:34,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:31:34,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:34,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:31:34,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:31:34,861 INFO L87 Difference]: Start difference. First operand 14835 states and 59421 transitions. Second operand 9 states. [2019-12-27 23:31:35,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:35,302 INFO L93 Difference]: Finished difference Result 17827 states and 69720 transitions. [2019-12-27 23:31:35,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 23:31:35,303 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-27 23:31:35,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:35,369 INFO L225 Difference]: With dead ends: 17827 [2019-12-27 23:31:35,369 INFO L226 Difference]: Without dead ends: 17107 [2019-12-27 23:31:35,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:31:35,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17107 states. [2019-12-27 23:31:35,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17107 to 14814. [2019-12-27 23:31:35,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14814 states. [2019-12-27 23:31:35,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14814 states to 14814 states and 59389 transitions. [2019-12-27 23:31:35,855 INFO L78 Accepts]: Start accepts. Automaton has 14814 states and 59389 transitions. Word has length 53 [2019-12-27 23:31:35,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:35,855 INFO L462 AbstractCegarLoop]: Abstraction has 14814 states and 59389 transitions. [2019-12-27 23:31:35,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:31:35,856 INFO L276 IsEmpty]: Start isEmpty. Operand 14814 states and 59389 transitions. [2019-12-27 23:31:35,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 23:31:35,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:35,880 INFO L411 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-12-27 23:31:35,881 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-12-27 23:31:35,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:35,881 INFO L82 PathProgramCache]: Analyzing trace with hash 2072130299, now seen corresponding path program 3 times [2019-12-27 23:31:35,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:35,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954623907] [2019-12-27 23:31:35,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:36,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:36,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954623907] [2019-12-27 23:31:36,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:36,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 23:31:36,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1190617451] [2019-12-27 23:31:36,093 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:36,099 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:36,132 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 112 states and 179 transitions. [2019-12-27 23:31:36,132 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:36,134 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 23:31:36,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:31:36,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:36,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:31:36,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:31:36,135 INFO L87 Difference]: Start difference. First operand 14814 states and 59389 transitions. Second operand 10 states. [2019-12-27 23:31:36,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:36,770 INFO L93 Difference]: Finished difference Result 17801 states and 69679 transitions. [2019-12-27 23:31:36,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:31:36,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-12-27 23:31:36,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:36,807 INFO L225 Difference]: With dead ends: 17801 [2019-12-27 23:31:36,807 INFO L226 Difference]: Without dead ends: 17081 [2019-12-27 23:31:36,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 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-12-27 23:31:36,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17081 states. [2019-12-27 23:31:37,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17081 to 14809. [2019-12-27 23:31:37,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14809 states. [2019-12-27 23:31:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 59380 transitions. [2019-12-27 23:31:37,076 INFO L78 Accepts]: Start accepts. Automaton has 14809 states and 59380 transitions. Word has length 53 [2019-12-27 23:31:37,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:37,076 INFO L462 AbstractCegarLoop]: Abstraction has 14809 states and 59380 transitions. [2019-12-27 23:31:37,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:31:37,076 INFO L276 IsEmpty]: Start isEmpty. Operand 14809 states and 59380 transitions. [2019-12-27 23:31:37,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 23:31:37,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:37,091 INFO L411 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-12-27 23:31:37,091 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-12-27 23:31:37,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:37,091 INFO L82 PathProgramCache]: Analyzing trace with hash -230306945, now seen corresponding path program 4 times [2019-12-27 23:31:37,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:37,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749217546] [2019-12-27 23:31:37,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:37,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:37,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749217546] [2019-12-27 23:31:37,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:37,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 23:31:37,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1074864504] [2019-12-27 23:31:37,279 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:37,285 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:37,316 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 195 transitions. [2019-12-27 23:31:37,316 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:37,318 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:31:37,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:31:37,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:37,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:31:37,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:31:37,318 INFO L87 Difference]: Start difference. First operand 14809 states and 59380 transitions. Second operand 12 states. [2019-12-27 23:31:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:38,102 INFO L93 Difference]: Finished difference Result 17780 states and 69636 transitions. [2019-12-27 23:31:38,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:31:38,102 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-12-27 23:31:38,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:38,139 INFO L225 Difference]: With dead ends: 17780 [2019-12-27 23:31:38,139 INFO L226 Difference]: Without dead ends: 17060 [2019-12-27 23:31:38,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 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-12-27 23:31:38,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17060 states. [2019-12-27 23:31:38,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17060 to 14799. [2019-12-27 23:31:38,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14799 states. [2019-12-27 23:31:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14799 states to 14799 states and 59356 transitions. [2019-12-27 23:31:38,419 INFO L78 Accepts]: Start accepts. Automaton has 14799 states and 59356 transitions. Word has length 53 [2019-12-27 23:31:38,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:38,420 INFO L462 AbstractCegarLoop]: Abstraction has 14799 states and 59356 transitions. [2019-12-27 23:31:38,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:31:38,420 INFO L276 IsEmpty]: Start isEmpty. Operand 14799 states and 59356 transitions. [2019-12-27 23:31:38,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 23:31:38,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:38,434 INFO L411 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-12-27 23:31:38,434 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-12-27 23:31:38,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:38,435 INFO L82 PathProgramCache]: Analyzing trace with hash -149039827, now seen corresponding path program 5 times [2019-12-27 23:31:38,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:38,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624109797] [2019-12-27 23:31:38,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:38,704 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-12-27 23:31:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:38,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624109797] [2019-12-27 23:31:38,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:38,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 23:31:38,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [239358825] [2019-12-27 23:31:38,807 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:38,811 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:38,837 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 213 transitions. [2019-12-27 23:31:38,837 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:38,840 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:31:38,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 23:31:38,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:38,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 23:31:38,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:31:38,841 INFO L87 Difference]: Start difference. First operand 14799 states and 59356 transitions. Second operand 14 states. [2019-12-27 23:31:39,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:39,849 INFO L93 Difference]: Finished difference Result 17735 states and 69515 transitions. [2019-12-27 23:31:39,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:31:39,850 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2019-12-27 23:31:39,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:39,886 INFO L225 Difference]: With dead ends: 17735 [2019-12-27 23:31:39,886 INFO L226 Difference]: Without dead ends: 17015 [2019-12-27 23:31:39,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2019-12-27 23:31:39,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17015 states. [2019-12-27 23:31:40,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17015 to 14779. [2019-12-27 23:31:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14779 states. [2019-12-27 23:31:40,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14779 states to 14779 states and 59290 transitions. [2019-12-27 23:31:40,152 INFO L78 Accepts]: Start accepts. Automaton has 14779 states and 59290 transitions. Word has length 53 [2019-12-27 23:31:40,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:40,152 INFO L462 AbstractCegarLoop]: Abstraction has 14779 states and 59290 transitions. [2019-12-27 23:31:40,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 23:31:40,152 INFO L276 IsEmpty]: Start isEmpty. Operand 14779 states and 59290 transitions. [2019-12-27 23:31:40,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 23:31:40,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:40,166 INFO L411 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-12-27 23:31:40,166 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-12-27 23:31:40,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:40,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1879007737, now seen corresponding path program 6 times [2019-12-27 23:31:40,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:40,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119860002] [2019-12-27 23:31:40,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:40,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119860002] [2019-12-27 23:31:40,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:40,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 23:31:40,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [615837695] [2019-12-27 23:31:40,603 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:40,607 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:40,635 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 228 transitions. [2019-12-27 23:31:40,636 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:40,657 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 23:31:40,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 23:31:40,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:40,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 23:31:40,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:31:40,658 INFO L87 Difference]: Start difference. First operand 14779 states and 59290 transitions. Second operand 17 states. [2019-12-27 23:31:41,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:41,686 INFO L93 Difference]: Finished difference Result 17569 states and 68954 transitions. [2019-12-27 23:31:41,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 23:31:41,686 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2019-12-27 23:31:41,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:41,722 INFO L225 Difference]: With dead ends: 17569 [2019-12-27 23:31:41,722 INFO L226 Difference]: Without dead ends: 16849 [2019-12-27 23:31:41,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=236, Invalid=694, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:31:41,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16849 states. [2019-12-27 23:31:41,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16849 to 14723. [2019-12-27 23:31:41,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14723 states. [2019-12-27 23:31:41,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14723 states to 14723 states and 59062 transitions. [2019-12-27 23:31:41,987 INFO L78 Accepts]: Start accepts. Automaton has 14723 states and 59062 transitions. Word has length 53 [2019-12-27 23:31:41,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:41,987 INFO L462 AbstractCegarLoop]: Abstraction has 14723 states and 59062 transitions. [2019-12-27 23:31:41,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 23:31:41,988 INFO L276 IsEmpty]: Start isEmpty. Operand 14723 states and 59062 transitions. [2019-12-27 23:31:42,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 23:31:42,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:42,001 INFO L411 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-12-27 23:31:42,002 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-12-27 23:31:42,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:42,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1567369699, now seen corresponding path program 7 times [2019-12-27 23:31:42,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:42,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978470158] [2019-12-27 23:31:42,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:42,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:42,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978470158] [2019-12-27 23:31:42,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:42,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-27 23:31:42,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1173538106] [2019-12-27 23:31:42,584 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:42,590 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:42,632 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 235 transitions. [2019-12-27 23:31:42,632 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:42,636 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 23:31:42,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 23:31:42,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:42,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 23:31:42,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:31:42,638 INFO L87 Difference]: Start difference. First operand 14723 states and 59062 transitions. Second operand 19 states. [2019-12-27 23:31:45,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:45,168 INFO L93 Difference]: Finished difference Result 19823 states and 77779 transitions. [2019-12-27 23:31:45,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 23:31:45,169 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2019-12-27 23:31:45,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:45,235 INFO L225 Difference]: With dead ends: 19823 [2019-12-27 23:31:45,235 INFO L226 Difference]: Without dead ends: 17663 [2019-12-27 23:31:45,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=355, Invalid=1205, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 23:31:45,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17663 states. [2019-12-27 23:31:45,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17663 to 13403. [2019-12-27 23:31:45,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13403 states. [2019-12-27 23:31:45,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13403 states to 13403 states and 53710 transitions. [2019-12-27 23:31:45,522 INFO L78 Accepts]: Start accepts. Automaton has 13403 states and 53710 transitions. Word has length 53 [2019-12-27 23:31:45,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:45,523 INFO L462 AbstractCegarLoop]: Abstraction has 13403 states and 53710 transitions. [2019-12-27 23:31:45,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 23:31:45,523 INFO L276 IsEmpty]: Start isEmpty. Operand 13403 states and 53710 transitions. [2019-12-27 23:31:45,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 23:31:45,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:45,536 INFO L411 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-12-27 23:31:45,537 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-12-27 23:31:45,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:45,537 INFO L82 PathProgramCache]: Analyzing trace with hash -713827360, now seen corresponding path program 1 times [2019-12-27 23:31:45,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:45,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162538895] [2019-12-27 23:31:45,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:45,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:45,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162538895] [2019-12-27 23:31:45,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:45,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 23:31:45,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [538436993] [2019-12-27 23:31:45,857 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:45,862 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:45,889 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 127 states and 211 transitions. [2019-12-27 23:31:45,889 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:45,891 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:31:45,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 23:31:45,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:45,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 23:31:45,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:31:45,891 INFO L87 Difference]: Start difference. First operand 13403 states and 53710 transitions. Second operand 14 states. [2019-12-27 23:31:47,116 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-12-27 23:31:47,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:47,534 INFO L93 Difference]: Finished difference Result 17394 states and 67692 transitions. [2019-12-27 23:31:47,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 23:31:47,534 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-12-27 23:31:47,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:47,570 INFO L225 Difference]: With dead ends: 17394 [2019-12-27 23:31:47,570 INFO L226 Difference]: Without dead ends: 17106 [2019-12-27 23:31:47,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=227, Invalid=703, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:31:47,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17106 states. [2019-12-27 23:31:47,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17106 to 13433. [2019-12-27 23:31:47,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13433 states. [2019-12-27 23:31:47,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13433 states to 13433 states and 53802 transitions. [2019-12-27 23:31:47,810 INFO L78 Accepts]: Start accepts. Automaton has 13433 states and 53802 transitions. Word has length 55 [2019-12-27 23:31:47,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:47,810 INFO L462 AbstractCegarLoop]: Abstraction has 13433 states and 53802 transitions. [2019-12-27 23:31:47,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 23:31:47,810 INFO L276 IsEmpty]: Start isEmpty. Operand 13433 states and 53802 transitions. [2019-12-27 23:31:47,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 23:31:47,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:47,824 INFO L411 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-12-27 23:31:47,824 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-12-27 23:31:47,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:47,825 INFO L82 PathProgramCache]: Analyzing trace with hash -632560242, now seen corresponding path program 2 times [2019-12-27 23:31:47,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:47,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041529110] [2019-12-27 23:31:47,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:48,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:48,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041529110] [2019-12-27 23:31:48,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:48,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 23:31:48,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [986271551] [2019-12-27 23:31:48,264 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:48,269 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:48,299 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 229 transitions. [2019-12-27 23:31:48,299 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:48,302 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 23:31:48,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 23:31:48,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:48,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 23:31:48,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:31:48,303 INFO L87 Difference]: Start difference. First operand 13433 states and 53802 transitions. Second operand 16 states. [2019-12-27 23:31:50,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:50,024 INFO L93 Difference]: Finished difference Result 17713 states and 69001 transitions. [2019-12-27 23:31:50,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 23:31:50,025 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-12-27 23:31:50,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:50,059 INFO L225 Difference]: With dead ends: 17713 [2019-12-27 23:31:50,060 INFO L226 Difference]: Without dead ends: 17137 [2019-12-27 23:31:50,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 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-12-27 23:31:50,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17137 states. [2019-12-27 23:31:50,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17137 to 13292. [2019-12-27 23:31:50,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13292 states. [2019-12-27 23:31:50,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13292 states to 13292 states and 53402 transitions. [2019-12-27 23:31:50,302 INFO L78 Accepts]: Start accepts. Automaton has 13292 states and 53402 transitions. Word has length 55 [2019-12-27 23:31:50,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:50,303 INFO L462 AbstractCegarLoop]: Abstraction has 13292 states and 53402 transitions. [2019-12-27 23:31:50,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 23:31:50,303 INFO L276 IsEmpty]: Start isEmpty. Operand 13292 states and 53402 transitions. [2019-12-27 23:31:50,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 23:31:50,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:50,317 INFO L411 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-12-27 23:31:50,317 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-12-27 23:31:50,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:50,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1395487322, now seen corresponding path program 3 times [2019-12-27 23:31:50,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:50,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347978777] [2019-12-27 23:31:50,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:50,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347978777] [2019-12-27 23:31:50,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:50,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 23:31:50,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [30200165] [2019-12-27 23:31:50,784 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:50,788 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:50,821 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 140 states and 244 transitions. [2019-12-27 23:31:50,821 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:50,839 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 23:31:50,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 23:31:50,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:50,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 23:31:50,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:31:50,840 INFO L87 Difference]: Start difference. First operand 13292 states and 53402 transitions. Second operand 19 states. [2019-12-27 23:31:52,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:52,911 INFO L93 Difference]: Finished difference Result 9836 states and 39642 transitions. [2019-12-27 23:31:52,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 23:31:52,912 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-12-27 23:31:52,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:52,945 INFO L225 Difference]: With dead ends: 9836 [2019-12-27 23:31:52,945 INFO L226 Difference]: Without dead ends: 9260 [2019-12-27 23:31:52,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=455, Invalid=1525, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 23:31:52,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9260 states. [2019-12-27 23:31:53,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9260 to 6914. [2019-12-27 23:31:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6914 states. [2019-12-27 23:31:53,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6914 states to 6914 states and 28315 transitions. [2019-12-27 23:31:53,136 INFO L78 Accepts]: Start accepts. Automaton has 6914 states and 28315 transitions. Word has length 55 [2019-12-27 23:31:53,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:53,136 INFO L462 AbstractCegarLoop]: Abstraction has 6914 states and 28315 transitions. [2019-12-27 23:31:53,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 23:31:53,136 INFO L276 IsEmpty]: Start isEmpty. Operand 6914 states and 28315 transitions. [2019-12-27 23:31:53,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-27 23:31:53,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:53,146 INFO L411 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-12-27 23:31:53,146 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-12-27 23:31:53,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:53,146 INFO L82 PathProgramCache]: Analyzing trace with hash -734287533, now seen corresponding path program 1 times [2019-12-27 23:31:53,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:53,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959327778] [2019-12-27 23:31:53,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:53,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959327778] [2019-12-27 23:31:53,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:53,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 23:31:53,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1057081099] [2019-12-27 23:31:53,243 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:53,257 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:53,610 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 723 states and 2122 transitions. [2019-12-27 23:31:53,611 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:53,615 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 23:31:53,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:31:53,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:53,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:31:53,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:31:53,616 INFO L87 Difference]: Start difference. First operand 6914 states and 28315 transitions. Second operand 8 states. [2019-12-27 23:31:53,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:53,844 INFO L93 Difference]: Finished difference Result 6914 states and 28309 transitions. [2019-12-27 23:31:53,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 23:31:53,845 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-12-27 23:31:53,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:53,860 INFO L225 Difference]: With dead ends: 6914 [2019-12-27 23:31:53,861 INFO L226 Difference]: Without dead ends: 6887 [2019-12-27 23:31:53,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 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-12-27 23:31:53,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6887 states. [2019-12-27 23:31:53,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6887 to 6887. [2019-12-27 23:31:53,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6887 states. [2019-12-27 23:31:53,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6887 states to 6887 states and 28201 transitions. [2019-12-27 23:31:53,972 INFO L78 Accepts]: Start accepts. Automaton has 6887 states and 28201 transitions. Word has length 88 [2019-12-27 23:31:53,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:53,973 INFO L462 AbstractCegarLoop]: Abstraction has 6887 states and 28201 transitions. [2019-12-27 23:31:53,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:31:53,973 INFO L276 IsEmpty]: Start isEmpty. Operand 6887 states and 28201 transitions. [2019-12-27 23:31:53,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-27 23:31:53,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:53,983 INFO L411 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-12-27 23:31:53,983 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-12-27 23:31:53,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:53,983 INFO L82 PathProgramCache]: Analyzing trace with hash -812593641, now seen corresponding path program 1 times [2019-12-27 23:31:53,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:53,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783881430] [2019-12-27 23:31:53,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:54,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783881430] [2019-12-27 23:31:54,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:54,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 23:31:54,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [258770090] [2019-12-27 23:31:54,493 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:54,502 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:54,990 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 723 states and 2122 transitions. [2019-12-27 23:31:54,990 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:54,998 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 23:31:54,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 23:31:54,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:54,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 23:31:54,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:31:54,999 INFO L87 Difference]: Start difference. First operand 6887 states and 28201 transitions. Second operand 14 states. [2019-12-27 23:31:55,573 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-12-27 23:31:55,804 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-12-27 23:31:55,997 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2019-12-27 23:31:56,300 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2019-12-27 23:31:57,050 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2019-12-27 23:31:57,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:57,214 INFO L93 Difference]: Finished difference Result 9443 states and 38056 transitions. [2019-12-27 23:31:57,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:31:57,215 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2019-12-27 23:31:57,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:57,239 INFO L225 Difference]: With dead ends: 9443 [2019-12-27 23:31:57,239 INFO L226 Difference]: Without dead ends: 9335 [2019-12-27 23:31:57,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 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-12-27 23:31:57,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9335 states. [2019-12-27 23:31:57,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9335 to 7049. [2019-12-27 23:31:57,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7049 states. [2019-12-27 23:31:57,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7049 states to 7049 states and 28759 transitions. [2019-12-27 23:31:57,385 INFO L78 Accepts]: Start accepts. Automaton has 7049 states and 28759 transitions. Word has length 88 [2019-12-27 23:31:57,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:57,385 INFO L462 AbstractCegarLoop]: Abstraction has 7049 states and 28759 transitions. [2019-12-27 23:31:57,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 23:31:57,385 INFO L276 IsEmpty]: Start isEmpty. Operand 7049 states and 28759 transitions. [2019-12-27 23:31:57,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-27 23:31:57,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:57,396 INFO L411 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-12-27 23:31:57,397 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-12-27 23:31:57,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:57,397 INFO L82 PathProgramCache]: Analyzing trace with hash 794295666, now seen corresponding path program 1 times [2019-12-27 23:31:57,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:57,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960586085] [2019-12-27 23:31:57,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:57,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960586085] [2019-12-27 23:31:57,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:57,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 23:31:57,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [885080369] [2019-12-27 23:31:57,518 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:57,529 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:57,906 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 723 states and 2122 transitions. [2019-12-27 23:31:57,906 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:57,910 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 23:31:57,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:31:57,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:57,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:31:57,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:31:57,911 INFO L87 Difference]: Start difference. First operand 7049 states and 28759 transitions. Second operand 8 states. [2019-12-27 23:31:58,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:58,141 INFO L93 Difference]: Finished difference Result 7049 states and 28753 transitions. [2019-12-27 23:31:58,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 23:31:58,142 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-12-27 23:31:58,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:58,158 INFO L225 Difference]: With dead ends: 7049 [2019-12-27 23:31:58,159 INFO L226 Difference]: Without dead ends: 6941 [2019-12-27 23:31:58,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 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-12-27 23:31:58,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6941 states. [2019-12-27 23:31:58,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6941 to 6941. [2019-12-27 23:31:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6941 states. [2019-12-27 23:31:58,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6941 states to 6941 states and 28321 transitions. [2019-12-27 23:31:58,269 INFO L78 Accepts]: Start accepts. Automaton has 6941 states and 28321 transitions. Word has length 88 [2019-12-27 23:31:58,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:58,269 INFO L462 AbstractCegarLoop]: Abstraction has 6941 states and 28321 transitions. [2019-12-27 23:31:58,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:31:58,269 INFO L276 IsEmpty]: Start isEmpty. Operand 6941 states and 28321 transitions. [2019-12-27 23:31:58,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-27 23:31:58,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:58,279 INFO L411 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-12-27 23:31:58,279 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-12-27 23:31:58,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:58,280 INFO L82 PathProgramCache]: Analyzing trace with hash 755142612, now seen corresponding path program 1 times [2019-12-27 23:31:58,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:58,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566217981] [2019-12-27 23:31:58,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:58,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566217981] [2019-12-27 23:31:58,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:58,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 23:31:58,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [829932142] [2019-12-27 23:31:58,475 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:58,484 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:58,904 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 723 states and 2122 transitions. [2019-12-27 23:31:58,905 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:58,909 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 23:31:58,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:31:58,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:58,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:31:58,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:31:58,910 INFO L87 Difference]: Start difference. First operand 6941 states and 28321 transitions. Second operand 10 states. [2019-12-27 23:31:59,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:59,356 INFO L93 Difference]: Finished difference Result 6941 states and 28273 transitions. [2019-12-27 23:31:59,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 23:31:59,357 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-12-27 23:31:59,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:59,372 INFO L225 Difference]: With dead ends: 6941 [2019-12-27 23:31:59,372 INFO L226 Difference]: Without dead ends: 6446 [2019-12-27 23:31:59,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 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-12-27 23:31:59,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6446 states. [2019-12-27 23:31:59,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6446 to 6446. [2019-12-27 23:31:59,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6446 states. [2019-12-27 23:31:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6446 states to 6446 states and 26161 transitions. [2019-12-27 23:31:59,478 INFO L78 Accepts]: Start accepts. Automaton has 6446 states and 26161 transitions. Word has length 88 [2019-12-27 23:31:59,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:59,479 INFO L462 AbstractCegarLoop]: Abstraction has 6446 states and 26161 transitions. [2019-12-27 23:31:59,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:31:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 6446 states and 26161 transitions. [2019-12-27 23:31:59,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-27 23:31:59,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:59,488 INFO L411 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-12-27 23:31:59,488 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-12-27 23:31:59,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:59,489 INFO L82 PathProgramCache]: Analyzing trace with hash -329848485, now seen corresponding path program 1 times [2019-12-27 23:31:59,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:59,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566386421] [2019-12-27 23:31:59,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:59,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566386421] [2019-12-27 23:31:59,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:31:59,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 23:31:59,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [134784764] [2019-12-27 23:31:59,614 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:59,626 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:59,968 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 723 states and 2122 transitions. [2019-12-27 23:31:59,969 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:59,974 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:31:59,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:31:59,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:59,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:31:59,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:31:59,975 INFO L87 Difference]: Start difference. First operand 6446 states and 26161 transitions. Second operand 8 states. [2019-12-27 23:32:00,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:32:00,178 INFO L93 Difference]: Finished difference Result 6446 states and 26155 transitions. [2019-12-27 23:32:00,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 23:32:00,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-12-27 23:32:00,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:32:00,195 INFO L225 Difference]: With dead ends: 6446 [2019-12-27 23:32:00,195 INFO L226 Difference]: Without dead ends: 5213 [2019-12-27 23:32:00,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 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-12-27 23:32:00,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5213 states. [2019-12-27 23:32:00,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5213 to 5213. [2019-12-27 23:32:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5213 states. [2019-12-27 23:32:00,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5213 states to 5213 states and 21079 transitions. [2019-12-27 23:32:00,289 INFO L78 Accepts]: Start accepts. Automaton has 5213 states and 21079 transitions. Word has length 88 [2019-12-27 23:32:00,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:32:00,290 INFO L462 AbstractCegarLoop]: Abstraction has 5213 states and 21079 transitions. [2019-12-27 23:32:00,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:32:00,290 INFO L276 IsEmpty]: Start isEmpty. Operand 5213 states and 21079 transitions. [2019-12-27 23:32:00,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-27 23:32:00,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:32:00,298 INFO L411 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-12-27 23:32:00,299 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-12-27 23:32:00,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:32:00,299 INFO L82 PathProgramCache]: Analyzing trace with hash -14930375, now seen corresponding path program 1 times [2019-12-27 23:32:00,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:32:00,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390426733] [2019-12-27 23:32:00,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:32:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:32:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:32:00,394 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 23:32:00,394 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 23:32:00,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:32:00 BasicIcfg [2019-12-27 23:32:00,529 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 23:32:00,531 INFO L168 Benchmark]: Toolchain (without parser) took 121994.32 ms. Allocated memory was 142.6 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 105.6 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 23:32:00,531 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 142.6 MB. Free memory was 125.8 MB in the beginning and 125.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 23:32:00,532 INFO L168 Benchmark]: CACSL2BoogieTranslator took 982.21 ms. Allocated memory was 142.6 MB in the beginning and 205.5 MB in the end (delta: 62.9 MB). Free memory was 105.2 MB in the beginning and 124.9 MB in the end (delta: -19.6 MB). Peak memory consumption was 48.5 MB. Max. memory is 7.1 GB. [2019-12-27 23:32:00,532 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.11 ms. Allocated memory is still 205.5 MB. Free memory was 124.9 MB in the beginning and 122.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 23:32:00,532 INFO L168 Benchmark]: Boogie Preprocessor took 49.50 ms. Allocated memory is still 205.5 MB. Free memory was 122.4 MB in the beginning and 120.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 23:32:00,533 INFO L168 Benchmark]: RCFGBuilder took 526.38 ms. Allocated memory was 205.5 MB in the beginning and 232.3 MB in the end (delta: 26.7 MB). Free memory was 120.5 MB in the beginning and 198.8 MB in the end (delta: -78.3 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2019-12-27 23:32:00,533 INFO L168 Benchmark]: TraceAbstraction took 120329.77 ms. Allocated memory was 232.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 198.8 MB in the beginning and 1.2 GB in the end (delta: -973.7 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 23:32:00,535 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.19 ms. Allocated memory is still 142.6 MB. Free memory was 125.8 MB in the beginning and 125.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 982.21 ms. Allocated memory was 142.6 MB in the beginning and 205.5 MB in the end (delta: 62.9 MB). Free memory was 105.2 MB in the beginning and 124.9 MB in the end (delta: -19.6 MB). Peak memory consumption was 48.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 101.11 ms. Allocated memory is still 205.5 MB. Free memory was 124.9 MB in the beginning and 122.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.50 ms. Allocated memory is still 205.5 MB. Free memory was 122.4 MB in the beginning and 120.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 526.38 ms. Allocated memory was 205.5 MB in the beginning and 232.3 MB in the end (delta: 26.7 MB). Free memory was 120.5 MB in the beginning and 198.8 MB in the end (delta: -78.3 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 120329.77 ms. Allocated memory was 232.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 198.8 MB in the beginning and 1.2 GB in the end (delta: -973.7 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 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={8:0}, t2={9:0}, v={0:0}] [L1124] 0 \read(t) VAL [arg={0:0}, arg={0:0}, t1={8:0}, t2={9:0}, v={0:0}] [L1107] 1 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={8:0}, t2={9:0}, t3={10:0}, t4={11: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={9:0}, t3={10:0}, t4={11: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={10:0}, t4={11: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={11: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: 119.8s, OverallIterations: 45, TraceHistogramMax: 1, AutomataDifference: 57.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8551 SDtfs, 19227 SDslu, 35569 SDs, 0 SdLazy, 16401 SolverSat, 2474 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1679 GetRequests, 709 SyntacticMatches, 60 SemanticMatches, 910 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3713 ImplicationChecksByTransitivity, 32.9s 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: 37.9s AutomataMinimizationTime, 44 MinimizatonAttempts, 201071 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 2417 NumberOfCodeBlocks, 2417 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 2285 ConstructedInterpolants, 0 QuantifiedInterpolants, 1731986 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 44 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...