/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-wmm/safe033_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 05:27:30,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 05:27:30,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 05:27:30,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 05:27:30,199 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 05:27:30,200 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 05:27:30,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 05:27:30,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 05:27:30,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 05:27:30,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 05:27:30,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 05:27:30,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 05:27:30,209 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 05:27:30,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 05:27:30,211 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 05:27:30,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 05:27:30,213 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 05:27:30,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 05:27:30,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 05:27:30,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 05:27:30,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 05:27:30,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 05:27:30,223 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 05:27:30,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 05:27:30,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 05:27:30,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 05:27:30,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 05:27:30,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 05:27:30,232 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 05:27:30,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 05:27:30,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 05:27:30,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 05:27:30,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 05:27:30,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 05:27:30,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 05:27:30,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 05:27:30,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 05:27:30,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 05:27:30,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 05:27:30,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 05:27:30,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 05:27:30,253 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-28 05:27:30,268 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 05:27:30,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 05:27:30,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 05:27:30,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 05:27:30,270 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 05:27:30,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 05:27:30,271 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 05:27:30,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 05:27:30,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 05:27:30,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 05:27:30,272 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 05:27:30,272 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 05:27:30,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 05:27:30,272 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 05:27:30,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 05:27:30,273 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 05:27:30,273 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 05:27:30,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 05:27:30,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 05:27:30,273 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 05:27:30,274 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 05:27:30,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 05:27:30,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 05:27:30,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 05:27:30,274 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 05:27:30,275 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 05:27:30,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 05:27:30,275 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 05:27:30,275 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 05:27:30,275 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 05:27:30,276 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 05:27:30,276 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 05:27:30,575 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 05:27:30,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 05:27:30,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 05:27:30,604 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 05:27:30,605 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 05:27:30,606 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_pso.opt.i [2019-12-28 05:27:30,681 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cea22007/f7b03add2edb420e91d662b4e368f9d6/FLAGddbdd06ad [2019-12-28 05:27:31,280 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 05:27:31,281 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_pso.opt.i [2019-12-28 05:27:31,296 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cea22007/f7b03add2edb420e91d662b4e368f9d6/FLAGddbdd06ad [2019-12-28 05:27:31,576 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cea22007/f7b03add2edb420e91d662b4e368f9d6 [2019-12-28 05:27:31,586 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 05:27:31,588 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 05:27:31,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 05:27:31,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 05:27:31,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 05:27:31,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:27:31" (1/1) ... [2019-12-28 05:27:31,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e211ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:31, skipping insertion in model container [2019-12-28 05:27:31,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:27:31" (1/1) ... [2019-12-28 05:27:31,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 05:27:31,662 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 05:27:32,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 05:27:32,157 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 05:27:32,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 05:27:32,366 INFO L208 MainTranslator]: Completed translation [2019-12-28 05:27:32,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:32 WrapperNode [2019-12-28 05:27:32,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 05:27:32,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 05:27:32,368 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 05:27:32,370 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 05:27:32,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:32" (1/1) ... [2019-12-28 05:27:32,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:32" (1/1) ... [2019-12-28 05:27:32,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 05:27:32,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 05:27:32,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 05:27:32,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 05:27:32,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:32" (1/1) ... [2019-12-28 05:27:32,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:32" (1/1) ... [2019-12-28 05:27:32,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:32" (1/1) ... [2019-12-28 05:27:32,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:32" (1/1) ... [2019-12-28 05:27:32,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:32" (1/1) ... [2019-12-28 05:27:32,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:32" (1/1) ... [2019-12-28 05:27:32,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:32" (1/1) ... [2019-12-28 05:27:32,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 05:27:32,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 05:27:32,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 05:27:32,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 05:27:32,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:32" (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-28 05:27:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 05:27:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 05:27:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 05:27:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 05:27:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 05:27:32,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 05:27:32,545 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 05:27:32,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 05:27:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 05:27:32,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 05:27:32,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 05:27:32,549 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 05:27:33,264 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 05:27:33,265 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 05:27:33,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:27:33 BoogieIcfgContainer [2019-12-28 05:27:33,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 05:27:33,267 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 05:27:33,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 05:27:33,271 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 05:27:33,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:27:31" (1/3) ... [2019-12-28 05:27:33,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b29ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:27:33, skipping insertion in model container [2019-12-28 05:27:33,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:27:32" (2/3) ... [2019-12-28 05:27:33,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b29ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:27:33, skipping insertion in model container [2019-12-28 05:27:33,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:27:33" (3/3) ... [2019-12-28 05:27:33,275 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_pso.opt.i [2019-12-28 05:27:33,285 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 05:27:33,285 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 05:27:33,292 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 05:27:33,293 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 05:27:33,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,332 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,332 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,356 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,357 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,357 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,357 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,358 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,369 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,369 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,369 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,376 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,377 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:27:33,397 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 05:27:33,419 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 05:27:33,419 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 05:27:33,419 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 05:27:33,419 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 05:27:33,420 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 05:27:33,420 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 05:27:33,420 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 05:27:33,420 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 05:27:33,435 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 134 places, 162 transitions [2019-12-28 05:27:35,004 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25974 states. [2019-12-28 05:27:35,006 INFO L276 IsEmpty]: Start isEmpty. Operand 25974 states. [2019-12-28 05:27:35,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-28 05:27:35,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:35,016 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] [2019-12-28 05:27:35,017 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:35,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:35,023 INFO L82 PathProgramCache]: Analyzing trace with hash 310103372, now seen corresponding path program 1 times [2019-12-28 05:27:35,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:35,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080952327] [2019-12-28 05:27:35,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:35,389 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-28 05:27:35,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080952327] [2019-12-28 05:27:35,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:35,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:27:35,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [621812737] [2019-12-28 05:27:35,394 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:35,402 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:35,435 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 37 transitions. [2019-12-28 05:27:35,435 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:35,441 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:35,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 05:27:35,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:35,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 05:27:35,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:27:35,460 INFO L87 Difference]: Start difference. First operand 25974 states. Second operand 4 states. [2019-12-28 05:27:36,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:36,781 INFO L93 Difference]: Finished difference Result 26614 states and 102119 transitions. [2019-12-28 05:27:36,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 05:27:36,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-28 05:27:36,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:37,006 INFO L225 Difference]: With dead ends: 26614 [2019-12-28 05:27:37,006 INFO L226 Difference]: Without dead ends: 20358 [2019-12-28 05:27:37,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:27:37,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20358 states. [2019-12-28 05:27:37,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20358 to 20358. [2019-12-28 05:27:37,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20358 states. [2019-12-28 05:27:38,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20358 states to 20358 states and 78423 transitions. [2019-12-28 05:27:38,027 INFO L78 Accepts]: Start accepts. Automaton has 20358 states and 78423 transitions. Word has length 37 [2019-12-28 05:27:38,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:38,028 INFO L462 AbstractCegarLoop]: Abstraction has 20358 states and 78423 transitions. [2019-12-28 05:27:38,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 05:27:38,028 INFO L276 IsEmpty]: Start isEmpty. Operand 20358 states and 78423 transitions. [2019-12-28 05:27:38,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-28 05:27:38,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:38,043 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-28 05:27:38,044 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:38,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:38,044 INFO L82 PathProgramCache]: Analyzing trace with hash 2127220543, now seen corresponding path program 1 times [2019-12-28 05:27:38,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:38,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509785671] [2019-12-28 05:27:38,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:38,226 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-28 05:27:38,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509785671] [2019-12-28 05:27:38,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:38,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:27:38,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1473573848] [2019-12-28 05:27:38,228 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:38,239 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:38,247 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 45 transitions. [2019-12-28 05:27:38,247 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:38,247 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:38,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:27:38,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:38,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:27:38,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:27:38,251 INFO L87 Difference]: Start difference. First operand 20358 states and 78423 transitions. Second operand 5 states. [2019-12-28 05:27:39,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:39,142 INFO L93 Difference]: Finished difference Result 31836 states and 116040 transitions. [2019-12-28 05:27:39,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:27:39,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-28 05:27:39,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:39,338 INFO L225 Difference]: With dead ends: 31836 [2019-12-28 05:27:39,338 INFO L226 Difference]: Without dead ends: 31284 [2019-12-28 05:27:39,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:27:39,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31284 states. [2019-12-28 05:27:41,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31284 to 29703. [2019-12-28 05:27:41,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29703 states. [2019-12-28 05:27:41,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29703 states to 29703 states and 109517 transitions. [2019-12-28 05:27:41,347 INFO L78 Accepts]: Start accepts. Automaton has 29703 states and 109517 transitions. Word has length 45 [2019-12-28 05:27:41,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:41,349 INFO L462 AbstractCegarLoop]: Abstraction has 29703 states and 109517 transitions. [2019-12-28 05:27:41,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:27:41,349 INFO L276 IsEmpty]: Start isEmpty. Operand 29703 states and 109517 transitions. [2019-12-28 05:27:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-28 05:27:41,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:41,354 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] [2019-12-28 05:27:41,354 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:41,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:41,355 INFO L82 PathProgramCache]: Analyzing trace with hash -370499147, now seen corresponding path program 1 times [2019-12-28 05:27:41,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:41,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496600179] [2019-12-28 05:27:41,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:41,455 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-28 05:27:41,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496600179] [2019-12-28 05:27:41,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:41,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:27:41,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [569313547] [2019-12-28 05:27:41,457 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:41,463 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:41,473 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 118 transitions. [2019-12-28 05:27:41,473 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:41,477 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 05:27:41,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:27:41,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:41,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:27:41,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:27:41,478 INFO L87 Difference]: Start difference. First operand 29703 states and 109517 transitions. Second operand 5 states. [2019-12-28 05:27:42,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:42,264 INFO L93 Difference]: Finished difference Result 38694 states and 139689 transitions. [2019-12-28 05:27:42,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:27:42,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-28 05:27:42,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:42,387 INFO L225 Difference]: With dead ends: 38694 [2019-12-28 05:27:42,387 INFO L226 Difference]: Without dead ends: 38246 [2019-12-28 05:27:42,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:27:42,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38246 states. [2019-12-28 05:27:44,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38246 to 32949. [2019-12-28 05:27:44,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32949 states. [2019-12-28 05:27:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32949 states to 32949 states and 120526 transitions. [2019-12-28 05:27:44,760 INFO L78 Accepts]: Start accepts. Automaton has 32949 states and 120526 transitions. Word has length 46 [2019-12-28 05:27:44,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:44,760 INFO L462 AbstractCegarLoop]: Abstraction has 32949 states and 120526 transitions. [2019-12-28 05:27:44,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:27:44,760 INFO L276 IsEmpty]: Start isEmpty. Operand 32949 states and 120526 transitions. [2019-12-28 05:27:44,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-28 05:27:44,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:44,768 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] [2019-12-28 05:27:44,768 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:44,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:44,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1101725263, now seen corresponding path program 1 times [2019-12-28 05:27:44,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:44,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164528215] [2019-12-28 05:27:44,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:44,810 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-28 05:27:44,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164528215] [2019-12-28 05:27:44,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:44,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 05:27:44,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [995075476] [2019-12-28 05:27:44,811 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:44,818 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:44,830 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 93 states and 136 transitions. [2019-12-28 05:27:44,830 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:44,831 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 05:27:44,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 05:27:44,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:44,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 05:27:44,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 05:27:44,833 INFO L87 Difference]: Start difference. First operand 32949 states and 120526 transitions. Second operand 3 states. [2019-12-28 05:27:45,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:45,068 INFO L93 Difference]: Finished difference Result 42410 states and 152017 transitions. [2019-12-28 05:27:45,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 05:27:45,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-12-28 05:27:45,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:45,529 INFO L225 Difference]: With dead ends: 42410 [2019-12-28 05:27:45,530 INFO L226 Difference]: Without dead ends: 42410 [2019-12-28 05:27:45,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 05:27:45,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42410 states. [2019-12-28 05:27:46,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42410 to 37663. [2019-12-28 05:27:46,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37663 states. [2019-12-28 05:27:48,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37663 states to 37663 states and 136330 transitions. [2019-12-28 05:27:48,279 INFO L78 Accepts]: Start accepts. Automaton has 37663 states and 136330 transitions. Word has length 48 [2019-12-28 05:27:48,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:48,280 INFO L462 AbstractCegarLoop]: Abstraction has 37663 states and 136330 transitions. [2019-12-28 05:27:48,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 05:27:48,280 INFO L276 IsEmpty]: Start isEmpty. Operand 37663 states and 136330 transitions. [2019-12-28 05:27:48,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 05:27:48,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:48,294 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-28 05:27:48,294 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:48,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:48,294 INFO L82 PathProgramCache]: Analyzing trace with hash -929169210, now seen corresponding path program 1 times [2019-12-28 05:27:48,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:48,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527840187] [2019-12-28 05:27:48,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:48,379 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-28 05:27:48,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527840187] [2019-12-28 05:27:48,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:48,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:27:48,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [667570539] [2019-12-28 05:27:48,380 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:48,387 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:48,405 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 113 states and 172 transitions. [2019-12-28 05:27:48,405 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:48,537 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 05:27:48,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 05:27:48,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:48,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 05:27:48,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:27:48,539 INFO L87 Difference]: Start difference. First operand 37663 states and 136330 transitions. Second operand 8 states. [2019-12-28 05:27:49,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:49,403 INFO L93 Difference]: Finished difference Result 48754 states and 172979 transitions. [2019-12-28 05:27:49,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 05:27:49,404 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-28 05:27:49,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:49,689 INFO L225 Difference]: With dead ends: 48754 [2019-12-28 05:27:49,689 INFO L226 Difference]: Without dead ends: 48234 [2019-12-28 05:27:49,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-28 05:27:49,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48234 states. [2019-12-28 05:27:50,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48234 to 38227. [2019-12-28 05:27:50,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38227 states. [2019-12-28 05:27:51,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38227 states to 38227 states and 138493 transitions. [2019-12-28 05:27:51,023 INFO L78 Accepts]: Start accepts. Automaton has 38227 states and 138493 transitions. Word has length 52 [2019-12-28 05:27:51,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:51,023 INFO L462 AbstractCegarLoop]: Abstraction has 38227 states and 138493 transitions. [2019-12-28 05:27:51,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 05:27:51,023 INFO L276 IsEmpty]: Start isEmpty. Operand 38227 states and 138493 transitions. [2019-12-28 05:27:51,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 05:27:51,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:51,041 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-28 05:27:51,041 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:51,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:51,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2144383564, now seen corresponding path program 1 times [2019-12-28 05:27:51,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:51,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265343443] [2019-12-28 05:27:51,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:51,176 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-28 05:27:51,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265343443] [2019-12-28 05:27:51,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:51,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:27:51,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1184913640] [2019-12-28 05:27:51,178 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:51,186 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:51,195 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 56 transitions. [2019-12-28 05:27:51,196 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:51,197 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:51,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:27:51,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:51,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:27:51,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:27:51,198 INFO L87 Difference]: Start difference. First operand 38227 states and 138493 transitions. Second operand 6 states. [2019-12-28 05:27:52,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:52,024 INFO L93 Difference]: Finished difference Result 53003 states and 189569 transitions. [2019-12-28 05:27:52,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:27:52,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-28 05:27:52,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:52,584 INFO L225 Difference]: With dead ends: 53003 [2019-12-28 05:27:52,584 INFO L226 Difference]: Without dead ends: 52027 [2019-12-28 05:27:52,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:27:52,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52027 states. [2019-12-28 05:27:53,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52027 to 48780. [2019-12-28 05:27:53,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48780 states. [2019-12-28 05:27:56,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48780 states to 48780 states and 175224 transitions. [2019-12-28 05:27:56,100 INFO L78 Accepts]: Start accepts. Automaton has 48780 states and 175224 transitions. Word has length 52 [2019-12-28 05:27:56,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:56,100 INFO L462 AbstractCegarLoop]: Abstraction has 48780 states and 175224 transitions. [2019-12-28 05:27:56,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:27:56,100 INFO L276 IsEmpty]: Start isEmpty. Operand 48780 states and 175224 transitions. [2019-12-28 05:27:56,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 05:27:56,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:56,119 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-28 05:27:56,119 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:56,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:56,120 INFO L82 PathProgramCache]: Analyzing trace with hash 347432205, now seen corresponding path program 1 times [2019-12-28 05:27:56,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:56,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070624585] [2019-12-28 05:27:56,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:56,244 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-28 05:27:56,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070624585] [2019-12-28 05:27:56,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:56,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 05:27:56,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1472951117] [2019-12-28 05:27:56,246 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:56,251 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:56,258 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 56 transitions. [2019-12-28 05:27:56,259 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:56,259 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:56,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 05:27:56,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:56,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 05:27:56,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:27:56,260 INFO L87 Difference]: Start difference. First operand 48780 states and 175224 transitions. Second operand 7 states. [2019-12-28 05:27:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:57,433 INFO L93 Difference]: Finished difference Result 70895 states and 244521 transitions. [2019-12-28 05:27:57,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 05:27:57,434 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-28 05:27:57,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:57,618 INFO L225 Difference]: With dead ends: 70895 [2019-12-28 05:27:57,618 INFO L226 Difference]: Without dead ends: 70895 [2019-12-28 05:27:57,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 05:27:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70895 states. [2019-12-28 05:27:58,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70895 to 57888. [2019-12-28 05:27:58,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57888 states. [2019-12-28 05:27:59,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57888 states to 57888 states and 203148 transitions. [2019-12-28 05:27:59,110 INFO L78 Accepts]: Start accepts. Automaton has 57888 states and 203148 transitions. Word has length 52 [2019-12-28 05:27:59,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:59,110 INFO L462 AbstractCegarLoop]: Abstraction has 57888 states and 203148 transitions. [2019-12-28 05:27:59,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 05:27:59,110 INFO L276 IsEmpty]: Start isEmpty. Operand 57888 states and 203148 transitions. [2019-12-28 05:27:59,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 05:27:59,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:59,124 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-28 05:27:59,125 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:59,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:59,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1234935886, now seen corresponding path program 1 times [2019-12-28 05:27:59,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:59,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229493247] [2019-12-28 05:27:59,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:59,203 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-28 05:27:59,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229493247] [2019-12-28 05:27:59,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:59,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:27:59,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1950237502] [2019-12-28 05:27:59,205 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:59,210 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:59,216 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 56 transitions. [2019-12-28 05:27:59,217 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:59,222 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 05:27:59,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 05:27:59,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:59,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 05:27:59,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:27:59,223 INFO L87 Difference]: Start difference. First operand 57888 states and 203148 transitions. Second operand 4 states. [2019-12-28 05:27:59,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:59,307 INFO L93 Difference]: Finished difference Result 10858 states and 33393 transitions. [2019-12-28 05:27:59,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 05:27:59,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-28 05:27:59,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:59,331 INFO L225 Difference]: With dead ends: 10858 [2019-12-28 05:27:59,331 INFO L226 Difference]: Without dead ends: 9359 [2019-12-28 05:27:59,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:27:59,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9359 states. [2019-12-28 05:27:59,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9359 to 9311. [2019-12-28 05:27:59,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9311 states. [2019-12-28 05:27:59,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9311 states to 9311 states and 28343 transitions. [2019-12-28 05:27:59,531 INFO L78 Accepts]: Start accepts. Automaton has 9311 states and 28343 transitions. Word has length 52 [2019-12-28 05:27:59,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:59,531 INFO L462 AbstractCegarLoop]: Abstraction has 9311 states and 28343 transitions. [2019-12-28 05:27:59,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 05:27:59,531 INFO L276 IsEmpty]: Start isEmpty. Operand 9311 states and 28343 transitions. [2019-12-28 05:27:59,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-28 05:27:59,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:59,538 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] [2019-12-28 05:27:59,538 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:59,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:59,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1215430140, now seen corresponding path program 1 times [2019-12-28 05:27:59,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:59,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042987256] [2019-12-28 05:27:59,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:59,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-28 05:27:59,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042987256] [2019-12-28 05:27:59,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:59,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:27:59,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1251772765] [2019-12-28 05:27:59,756 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:59,766 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:59,797 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 131 states and 198 transitions. [2019-12-28 05:27:59,797 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:59,799 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 05:27:59,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 05:27:59,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:59,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 05:27:59,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:27:59,801 INFO L87 Difference]: Start difference. First operand 9311 states and 28343 transitions. Second operand 4 states. [2019-12-28 05:27:59,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:59,960 INFO L93 Difference]: Finished difference Result 10886 states and 33035 transitions. [2019-12-28 05:27:59,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 05:27:59,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-28 05:27:59,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:59,980 INFO L225 Difference]: With dead ends: 10886 [2019-12-28 05:27:59,981 INFO L226 Difference]: Without dead ends: 10886 [2019-12-28 05:27:59,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:28:00,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10886 states. [2019-12-28 05:28:00,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10886 to 9878. [2019-12-28 05:28:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9878 states. [2019-12-28 05:28:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9878 states to 9878 states and 30014 transitions. [2019-12-28 05:28:00,176 INFO L78 Accepts]: Start accepts. Automaton has 9878 states and 30014 transitions. Word has length 62 [2019-12-28 05:28:00,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:28:00,176 INFO L462 AbstractCegarLoop]: Abstraction has 9878 states and 30014 transitions. [2019-12-28 05:28:00,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 05:28:00,176 INFO L276 IsEmpty]: Start isEmpty. Operand 9878 states and 30014 transitions. [2019-12-28 05:28:00,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-28 05:28:00,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:28:00,182 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] [2019-12-28 05:28:00,182 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:28:00,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:28:00,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1336726821, now seen corresponding path program 1 times [2019-12-28 05:28:00,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:28:00,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296977823] [2019-12-28 05:28:00,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:28:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:28:00,249 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-28 05:28:00,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296977823] [2019-12-28 05:28:00,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:28:00,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:28:00,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1170465779] [2019-12-28 05:28:00,251 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:28:00,260 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:28:00,286 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 131 states and 198 transitions. [2019-12-28 05:28:00,286 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:28:00,287 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 05:28:00,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:28:00,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:28:00,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:28:00,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:28:00,288 INFO L87 Difference]: Start difference. First operand 9878 states and 30014 transitions. Second operand 6 states. [2019-12-28 05:28:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:28:00,867 INFO L93 Difference]: Finished difference Result 12784 states and 38224 transitions. [2019-12-28 05:28:00,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 05:28:00,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-28 05:28:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:28:00,885 INFO L225 Difference]: With dead ends: 12784 [2019-12-28 05:28:00,886 INFO L226 Difference]: Without dead ends: 12736 [2019-12-28 05:28:00,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-12-28 05:28:00,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12736 states. [2019-12-28 05:28:01,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12736 to 10617. [2019-12-28 05:28:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10617 states. [2019-12-28 05:28:01,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10617 states to 10617 states and 32067 transitions. [2019-12-28 05:28:01,037 INFO L78 Accepts]: Start accepts. Automaton has 10617 states and 32067 transitions. Word has length 62 [2019-12-28 05:28:01,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:28:01,038 INFO L462 AbstractCegarLoop]: Abstraction has 10617 states and 32067 transitions. [2019-12-28 05:28:01,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:28:01,038 INFO L276 IsEmpty]: Start isEmpty. Operand 10617 states and 32067 transitions. [2019-12-28 05:28:01,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-28 05:28:01,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:28:01,045 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] [2019-12-28 05:28:01,045 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:28:01,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:28:01,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1540685473, now seen corresponding path program 1 times [2019-12-28 05:28:01,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:28:01,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716385750] [2019-12-28 05:28:01,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:28:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:28:01,097 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-28 05:28:01,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716385750] [2019-12-28 05:28:01,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:28:01,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 05:28:01,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [979674466] [2019-12-28 05:28:01,098 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:28:01,108 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:28:01,119 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 64 transitions. [2019-12-28 05:28:01,120 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:28:01,120 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:28:01,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 05:28:01,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:28:01,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 05:28:01,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 05:28:01,121 INFO L87 Difference]: Start difference. First operand 10617 states and 32067 transitions. Second operand 3 states. [2019-12-28 05:28:01,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:28:01,321 INFO L93 Difference]: Finished difference Result 11193 states and 33595 transitions. [2019-12-28 05:28:01,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 05:28:01,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-28 05:28:01,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:28:01,336 INFO L225 Difference]: With dead ends: 11193 [2019-12-28 05:28:01,336 INFO L226 Difference]: Without dead ends: 11193 [2019-12-28 05:28:01,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 05:28:01,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11193 states. [2019-12-28 05:28:01,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11193 to 10905. [2019-12-28 05:28:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10905 states. [2019-12-28 05:28:01,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10905 states to 10905 states and 32831 transitions. [2019-12-28 05:28:01,478 INFO L78 Accepts]: Start accepts. Automaton has 10905 states and 32831 transitions. Word has length 64 [2019-12-28 05:28:01,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:28:01,478 INFO L462 AbstractCegarLoop]: Abstraction has 10905 states and 32831 transitions. [2019-12-28 05:28:01,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 05:28:01,478 INFO L276 IsEmpty]: Start isEmpty. Operand 10905 states and 32831 transitions. [2019-12-28 05:28:01,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-28 05:28:01,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:28:01,486 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] [2019-12-28 05:28:01,486 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:28:01,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:28:01,487 INFO L82 PathProgramCache]: Analyzing trace with hash 536523870, now seen corresponding path program 1 times [2019-12-28 05:28:01,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:28:01,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583744758] [2019-12-28 05:28:01,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:28:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:28:01,551 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-28 05:28:01,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583744758] [2019-12-28 05:28:01,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:28:01,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:28:01,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2102341882] [2019-12-28 05:28:01,552 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:28:01,562 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:28:01,573 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 64 transitions. [2019-12-28 05:28:01,574 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:28:01,574 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:28:01,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 05:28:01,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:28:01,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 05:28:01,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:28:01,575 INFO L87 Difference]: Start difference. First operand 10905 states and 32831 transitions. Second operand 4 states. [2019-12-28 05:28:01,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:28:01,939 INFO L93 Difference]: Finished difference Result 13607 states and 40433 transitions. [2019-12-28 05:28:01,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 05:28:01,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-28 05:28:01,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:28:01,959 INFO L225 Difference]: With dead ends: 13607 [2019-12-28 05:28:01,959 INFO L226 Difference]: Without dead ends: 13607 [2019-12-28 05:28:01,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:28:01,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13607 states. [2019-12-28 05:28:02,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13607 to 12461. [2019-12-28 05:28:02,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12461 states. [2019-12-28 05:28:02,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12461 states to 12461 states and 37122 transitions. [2019-12-28 05:28:02,125 INFO L78 Accepts]: Start accepts. Automaton has 12461 states and 37122 transitions. Word has length 64 [2019-12-28 05:28:02,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:28:02,125 INFO L462 AbstractCegarLoop]: Abstraction has 12461 states and 37122 transitions. [2019-12-28 05:28:02,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 05:28:02,125 INFO L276 IsEmpty]: Start isEmpty. Operand 12461 states and 37122 transitions. [2019-12-28 05:28:02,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 05:28:02,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:28:02,136 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] [2019-12-28 05:28:02,136 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:28:02,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:28:02,137 INFO L82 PathProgramCache]: Analyzing trace with hash 762121994, now seen corresponding path program 1 times [2019-12-28 05:28:02,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:28:02,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437991379] [2019-12-28 05:28:02,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:28:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:28:02,254 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-28 05:28:02,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437991379] [2019-12-28 05:28:02,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:28:02,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:28:02,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1330474061] [2019-12-28 05:28:02,255 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:28:02,266 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:28:02,281 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 05:28:02,281 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:28:02,282 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:28:02,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:28:02,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:28:02,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:28:02,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:28:02,283 INFO L87 Difference]: Start difference. First operand 12461 states and 37122 transitions. Second operand 6 states. [2019-12-28 05:28:02,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:28:02,798 INFO L93 Difference]: Finished difference Result 13732 states and 40361 transitions. [2019-12-28 05:28:02,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:28:02,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-28 05:28:02,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:28:02,817 INFO L225 Difference]: With dead ends: 13732 [2019-12-28 05:28:02,817 INFO L226 Difference]: Without dead ends: 13732 [2019-12-28 05:28:02,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:28:02,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13732 states. [2019-12-28 05:28:02,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13732 to 13246. [2019-12-28 05:28:02,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13246 states. [2019-12-28 05:28:02,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13246 states to 13246 states and 39077 transitions. [2019-12-28 05:28:02,991 INFO L78 Accepts]: Start accepts. Automaton has 13246 states and 39077 transitions. Word has length 66 [2019-12-28 05:28:02,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:28:02,992 INFO L462 AbstractCegarLoop]: Abstraction has 13246 states and 39077 transitions. [2019-12-28 05:28:02,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:28:02,992 INFO L276 IsEmpty]: Start isEmpty. Operand 13246 states and 39077 transitions. [2019-12-28 05:28:03,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 05:28:03,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:28:03,004 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] [2019-12-28 05:28:03,004 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:28:03,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:28:03,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1315087349, now seen corresponding path program 1 times [2019-12-28 05:28:03,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:28:03,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728753721] [2019-12-28 05:28:03,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:28:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:28:03,106 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-28 05:28:03,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728753721] [2019-12-28 05:28:03,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:28:03,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:28:03,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1456794179] [2019-12-28 05:28:03,107 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:28:03,117 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:28:03,131 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 05:28:03,131 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:28:03,131 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:28:03,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:28:03,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:28:03,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:28:03,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:28:03,132 INFO L87 Difference]: Start difference. First operand 13246 states and 39077 transitions. Second operand 6 states. [2019-12-28 05:28:03,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:28:03,593 INFO L93 Difference]: Finished difference Result 15569 states and 44587 transitions. [2019-12-28 05:28:03,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 05:28:03,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-28 05:28:03,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:28:03,614 INFO L225 Difference]: With dead ends: 15569 [2019-12-28 05:28:03,614 INFO L226 Difference]: Without dead ends: 15569 [2019-12-28 05:28:03,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-28 05:28:03,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15569 states. [2019-12-28 05:28:03,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15569 to 13820. [2019-12-28 05:28:03,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13820 states. [2019-12-28 05:28:03,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13820 states to 13820 states and 39927 transitions. [2019-12-28 05:28:03,799 INFO L78 Accepts]: Start accepts. Automaton has 13820 states and 39927 transitions. Word has length 66 [2019-12-28 05:28:03,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:28:03,800 INFO L462 AbstractCegarLoop]: Abstraction has 13820 states and 39927 transitions. [2019-12-28 05:28:03,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:28:03,800 INFO L276 IsEmpty]: Start isEmpty. Operand 13820 states and 39927 transitions. [2019-12-28 05:28:03,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 05:28:03,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:28:03,813 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] [2019-12-28 05:28:03,814 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:28:03,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:28:03,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1103736436, now seen corresponding path program 1 times [2019-12-28 05:28:03,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:28:03,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728952965] [2019-12-28 05:28:03,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:28:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:28:03,881 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-28 05:28:03,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728952965] [2019-12-28 05:28:03,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:28:03,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:28:03,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [6660675] [2019-12-28 05:28:03,882 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:28:03,893 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:28:03,907 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 05:28:03,908 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:28:03,908 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:28:03,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:28:03,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:28:03,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:28:03,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:28:03,909 INFO L87 Difference]: Start difference. First operand 13820 states and 39927 transitions. Second operand 5 states. [2019-12-28 05:28:04,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:28:04,407 INFO L93 Difference]: Finished difference Result 17381 states and 50006 transitions. [2019-12-28 05:28:04,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 05:28:04,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-28 05:28:04,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:28:04,430 INFO L225 Difference]: With dead ends: 17381 [2019-12-28 05:28:04,430 INFO L226 Difference]: Without dead ends: 17381 [2019-12-28 05:28:04,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:28:04,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17381 states. [2019-12-28 05:28:04,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17381 to 14858. [2019-12-28 05:28:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14858 states. [2019-12-28 05:28:04,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14858 states to 14858 states and 42559 transitions. [2019-12-28 05:28:04,634 INFO L78 Accepts]: Start accepts. Automaton has 14858 states and 42559 transitions. Word has length 66 [2019-12-28 05:28:04,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:28:04,635 INFO L462 AbstractCegarLoop]: Abstraction has 14858 states and 42559 transitions. [2019-12-28 05:28:04,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:28:04,635 INFO L276 IsEmpty]: Start isEmpty. Operand 14858 states and 42559 transitions. [2019-12-28 05:28:04,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 05:28:04,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:28:04,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:28:04,648 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:28:04,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:28:04,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1614270613, now seen corresponding path program 1 times [2019-12-28 05:28:04,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:28:04,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128708532] [2019-12-28 05:28:04,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:28:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:28:04,705 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-28 05:28:04,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128708532] [2019-12-28 05:28:04,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:28:04,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:28:04,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [63780220] [2019-12-28 05:28:04,707 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:28:04,717 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:28:04,730 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 05:28:04,731 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:28:04,731 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:28:04,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:28:04,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:28:04,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:28:04,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:28:04,732 INFO L87 Difference]: Start difference. First operand 14858 states and 42559 transitions. Second operand 5 states. [2019-12-28 05:28:05,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:28:05,165 INFO L93 Difference]: Finished difference Result 19763 states and 56506 transitions. [2019-12-28 05:28:05,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:28:05,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-28 05:28:05,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:28:05,200 INFO L225 Difference]: With dead ends: 19763 [2019-12-28 05:28:05,200 INFO L226 Difference]: Without dead ends: 19763 [2019-12-28 05:28:05,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:28:05,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19763 states. [2019-12-28 05:28:05,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19763 to 15763. [2019-12-28 05:28:05,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15763 states. [2019-12-28 05:28:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15763 states to 15763 states and 45145 transitions. [2019-12-28 05:28:05,468 INFO L78 Accepts]: Start accepts. Automaton has 15763 states and 45145 transitions. Word has length 66 [2019-12-28 05:28:05,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:28:05,469 INFO L462 AbstractCegarLoop]: Abstraction has 15763 states and 45145 transitions. [2019-12-28 05:28:05,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:28:05,469 INFO L276 IsEmpty]: Start isEmpty. Operand 15763 states and 45145 transitions. [2019-12-28 05:28:05,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 05:28:05,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:28:05,481 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] [2019-12-28 05:28:05,481 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:28:05,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:28:05,481 INFO L82 PathProgramCache]: Analyzing trace with hash 873242220, now seen corresponding path program 1 times [2019-12-28 05:28:05,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:28:05,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521799111] [2019-12-28 05:28:05,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:28:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:28:05,529 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-28 05:28:05,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521799111] [2019-12-28 05:28:05,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:28:05,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:28:05,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [55577054] [2019-12-28 05:28:05,531 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:28:05,554 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:28:05,567 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 05:28:05,567 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:28:05,567 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:28:05,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 05:28:05,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:28:05,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 05:28:05,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:28:05,568 INFO L87 Difference]: Start difference. First operand 15763 states and 45145 transitions. Second operand 4 states. [2019-12-28 05:28:06,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:28:06,106 INFO L93 Difference]: Finished difference Result 20659 states and 59353 transitions. [2019-12-28 05:28:06,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 05:28:06,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-28 05:28:06,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:28:06,134 INFO L225 Difference]: With dead ends: 20659 [2019-12-28 05:28:06,134 INFO L226 Difference]: Without dead ends: 20383 [2019-12-28 05:28:06,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:28:06,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20383 states. [2019-12-28 05:28:06,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20383 to 18946. [2019-12-28 05:28:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18946 states. [2019-12-28 05:28:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18946 states to 18946 states and 54434 transitions. [2019-12-28 05:28:06,650 INFO L78 Accepts]: Start accepts. Automaton has 18946 states and 54434 transitions. Word has length 66 [2019-12-28 05:28:06,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:28:06,650 INFO L462 AbstractCegarLoop]: Abstraction has 18946 states and 54434 transitions. [2019-12-28 05:28:06,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 05:28:06,651 INFO L276 IsEmpty]: Start isEmpty. Operand 18946 states and 54434 transitions. [2019-12-28 05:28:06,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 05:28:06,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:28:06,662 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] [2019-12-28 05:28:06,662 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:28:06,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:28:06,662 INFO L82 PathProgramCache]: Analyzing trace with hash -923709139, now seen corresponding path program 1 times [2019-12-28 05:28:06,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:28:06,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730566873] [2019-12-28 05:28:06,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:28:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:28:06,818 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-28 05:28:06,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730566873] [2019-12-28 05:28:06,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:28:06,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 05:28:06,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1583809966] [2019-12-28 05:28:06,819 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:28:06,847 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:28:06,862 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 05:28:06,862 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:28:06,863 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:28:06,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 05:28:06,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:28:06,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 05:28:06,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:28:06,869 INFO L87 Difference]: Start difference. First operand 18946 states and 54434 transitions. Second operand 7 states. [2019-12-28 05:28:07,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:28:07,339 INFO L93 Difference]: Finished difference Result 17840 states and 48888 transitions. [2019-12-28 05:28:07,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 05:28:07,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-28 05:28:07,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:28:07,362 INFO L225 Difference]: With dead ends: 17840 [2019-12-28 05:28:07,363 INFO L226 Difference]: Without dead ends: 17840 [2019-12-28 05:28:07,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-28 05:28:07,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17840 states. [2019-12-28 05:28:07,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17840 to 12474. [2019-12-28 05:28:07,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12474 states. [2019-12-28 05:28:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12474 states to 12474 states and 34351 transitions. [2019-12-28 05:28:07,549 INFO L78 Accepts]: Start accepts. Automaton has 12474 states and 34351 transitions. Word has length 66 [2019-12-28 05:28:07,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:28:07,549 INFO L462 AbstractCegarLoop]: Abstraction has 12474 states and 34351 transitions. [2019-12-28 05:28:07,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 05:28:07,549 INFO L276 IsEmpty]: Start isEmpty. Operand 12474 states and 34351 transitions. [2019-12-28 05:28:07,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 05:28:07,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:28:07,559 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] [2019-12-28 05:28:07,559 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:28:07,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:28:07,560 INFO L82 PathProgramCache]: Analyzing trace with hash -36205458, now seen corresponding path program 1 times [2019-12-28 05:28:07,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:28:07,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225269001] [2019-12-28 05:28:07,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:28:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:28:07,638 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-28 05:28:07,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225269001] [2019-12-28 05:28:07,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:28:07,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:28:07,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1486454611] [2019-12-28 05:28:07,639 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:28:07,654 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:28:07,667 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 05:28:07,668 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:28:07,668 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:28:07,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:28:07,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:28:07,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:28:07,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:28:07,669 INFO L87 Difference]: Start difference. First operand 12474 states and 34351 transitions. Second operand 5 states. [2019-12-28 05:28:07,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:28:07,714 INFO L93 Difference]: Finished difference Result 4023 states and 9370 transitions. [2019-12-28 05:28:07,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 05:28:07,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-28 05:28:07,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:28:07,719 INFO L225 Difference]: With dead ends: 4023 [2019-12-28 05:28:07,719 INFO L226 Difference]: Without dead ends: 3350 [2019-12-28 05:28:07,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:28:07,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3350 states. [2019-12-28 05:28:07,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3350 to 3090. [2019-12-28 05:28:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3090 states. [2019-12-28 05:28:07,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 3090 states and 7076 transitions. [2019-12-28 05:28:07,767 INFO L78 Accepts]: Start accepts. Automaton has 3090 states and 7076 transitions. Word has length 66 [2019-12-28 05:28:07,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:28:07,767 INFO L462 AbstractCegarLoop]: Abstraction has 3090 states and 7076 transitions. [2019-12-28 05:28:07,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:28:07,767 INFO L276 IsEmpty]: Start isEmpty. Operand 3090 states and 7076 transitions. [2019-12-28 05:28:07,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 05:28:07,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:28:07,771 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] [2019-12-28 05:28:07,771 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:28:07,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:28:07,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1721997520, now seen corresponding path program 1 times [2019-12-28 05:28:07,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:28:07,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060582510] [2019-12-28 05:28:07,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:28:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:28:07,870 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-28 05:28:07,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060582510] [2019-12-28 05:28:07,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:28:07,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 05:28:07,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1589862796] [2019-12-28 05:28:07,871 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:28:07,888 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:28:07,947 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 281 transitions. [2019-12-28 05:28:07,947 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:28:08,024 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-28 05:28:08,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 05:28:08,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:28:08,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 05:28:08,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-28 05:28:08,025 INFO L87 Difference]: Start difference. First operand 3090 states and 7076 transitions. Second operand 10 states. [2019-12-28 05:28:09,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:28:09,481 INFO L93 Difference]: Finished difference Result 6377 states and 14423 transitions. [2019-12-28 05:28:09,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-28 05:28:09,482 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2019-12-28 05:28:09,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:28:09,490 INFO L225 Difference]: With dead ends: 6377 [2019-12-28 05:28:09,490 INFO L226 Difference]: Without dead ends: 6330 [2019-12-28 05:28:09,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2019-12-28 05:28:09,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6330 states. [2019-12-28 05:28:09,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6330 to 3414. [2019-12-28 05:28:09,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3414 states. [2019-12-28 05:28:09,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3414 states to 3414 states and 7811 transitions. [2019-12-28 05:28:09,539 INFO L78 Accepts]: Start accepts. Automaton has 3414 states and 7811 transitions. Word has length 83 [2019-12-28 05:28:09,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:28:09,539 INFO L462 AbstractCegarLoop]: Abstraction has 3414 states and 7811 transitions. [2019-12-28 05:28:09,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 05:28:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 3414 states and 7811 transitions. [2019-12-28 05:28:09,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 05:28:09,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:28:09,544 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] [2019-12-28 05:28:09,544 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:28:09,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:28:09,545 INFO L82 PathProgramCache]: Analyzing trace with hash -355211823, now seen corresponding path program 1 times [2019-12-28 05:28:09,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:28:09,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023472309] [2019-12-28 05:28:09,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:28:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:28:09,632 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-28 05:28:09,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023472309] [2019-12-28 05:28:09,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:28:09,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:28:09,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [13154015] [2019-12-28 05:28:09,634 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:28:09,651 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:28:09,724 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 281 transitions. [2019-12-28 05:28:09,725 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:28:09,740 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 05:28:09,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 05:28:09,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:28:09,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 05:28:09,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:28:09,742 INFO L87 Difference]: Start difference. First operand 3414 states and 7811 transitions. Second operand 7 states. [2019-12-28 05:28:09,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:28:09,822 INFO L93 Difference]: Finished difference Result 5783 states and 13274 transitions. [2019-12-28 05:28:09,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 05:28:09,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-28 05:28:09,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:28:09,827 INFO L225 Difference]: With dead ends: 5783 [2019-12-28 05:28:09,827 INFO L226 Difference]: Without dead ends: 2442 [2019-12-28 05:28:09,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-28 05:28:09,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2019-12-28 05:28:09,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2401. [2019-12-28 05:28:09,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2019-12-28 05:28:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 5493 transitions. [2019-12-28 05:28:09,851 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 5493 transitions. Word has length 83 [2019-12-28 05:28:09,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:28:09,851 INFO L462 AbstractCegarLoop]: Abstraction has 2401 states and 5493 transitions. [2019-12-28 05:28:09,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 05:28:09,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 5493 transitions. [2019-12-28 05:28:09,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 05:28:09,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:28:09,854 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] [2019-12-28 05:28:09,854 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:28:09,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:28:09,854 INFO L82 PathProgramCache]: Analyzing trace with hash 2146119358, now seen corresponding path program 1 times [2019-12-28 05:28:09,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:28:09,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138859375] [2019-12-28 05:28:09,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:28:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:28:09,925 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-28 05:28:09,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138859375] [2019-12-28 05:28:09,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:28:09,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:28:09,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [543225646] [2019-12-28 05:28:09,927 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:28:10,026 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:28:10,084 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 175 transitions. [2019-12-28 05:28:10,085 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:28:10,183 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 05:28:10,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 05:28:10,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:28:10,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 05:28:10,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-28 05:28:10,184 INFO L87 Difference]: Start difference. First operand 2401 states and 5493 transitions. Second operand 9 states. [2019-12-28 05:28:10,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:28:10,770 INFO L93 Difference]: Finished difference Result 2583 states and 5664 transitions. [2019-12-28 05:28:10,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 05:28:10,770 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-12-28 05:28:10,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:28:10,773 INFO L225 Difference]: With dead ends: 2583 [2019-12-28 05:28:10,774 INFO L226 Difference]: Without dead ends: 2583 [2019-12-28 05:28:10,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-12-28 05:28:10,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-12-28 05:28:10,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1724. [2019-12-28 05:28:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2019-12-28 05:28:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 3736 transitions. [2019-12-28 05:28:10,793 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 3736 transitions. Word has length 83 [2019-12-28 05:28:10,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:28:10,794 INFO L462 AbstractCegarLoop]: Abstraction has 1724 states and 3736 transitions. [2019-12-28 05:28:10,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 05:28:10,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 3736 transitions. [2019-12-28 05:28:10,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 05:28:10,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:28:10,795 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] [2019-12-28 05:28:10,795 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:28:10,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:28:10,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1743706764, now seen corresponding path program 2 times [2019-12-28 05:28:10,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:28:10,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66839071] [2019-12-28 05:28:10,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:28:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:28:10,916 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-28 05:28:10,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66839071] [2019-12-28 05:28:10,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:28:10,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:28:10,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1829165811] [2019-12-28 05:28:10,917 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:28:10,935 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:28:11,007 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 219 transitions. [2019-12-28 05:28:11,007 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:28:11,178 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-28 05:28:11,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-28 05:28:11,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:28:11,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-28 05:28:11,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-12-28 05:28:11,180 INFO L87 Difference]: Start difference. First operand 1724 states and 3736 transitions. Second operand 13 states. [2019-12-28 05:28:12,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:28:12,562 INFO L93 Difference]: Finished difference Result 2754 states and 5950 transitions. [2019-12-28 05:28:12,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-28 05:28:12,563 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 83 [2019-12-28 05:28:12,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:28:12,566 INFO L225 Difference]: With dead ends: 2754 [2019-12-28 05:28:12,567 INFO L226 Difference]: Without dead ends: 2706 [2019-12-28 05:28:12,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=623, Unknown=0, NotChecked=0, Total=870 [2019-12-28 05:28:12,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2706 states. [2019-12-28 05:28:12,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2706 to 1653. [2019-12-28 05:28:12,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1653 states. [2019-12-28 05:28:12,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 3543 transitions. [2019-12-28 05:28:12,588 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 3543 transitions. Word has length 83 [2019-12-28 05:28:12,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:28:12,588 INFO L462 AbstractCegarLoop]: Abstraction has 1653 states and 3543 transitions. [2019-12-28 05:28:12,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-28 05:28:12,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 3543 transitions. [2019-12-28 05:28:12,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 05:28:12,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:28:12,590 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] [2019-12-28 05:28:12,591 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:28:12,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:28:12,591 INFO L82 PathProgramCache]: Analyzing trace with hash 474051189, now seen corresponding path program 2 times [2019-12-28 05:28:12,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:28:12,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488685542] [2019-12-28 05:28:12,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:28:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:28:12,713 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-28 05:28:12,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488685542] [2019-12-28 05:28:12,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:28:12,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 05:28:12,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [357584457] [2019-12-28 05:28:12,714 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:28:12,732 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:28:12,802 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 219 transitions. [2019-12-28 05:28:12,802 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:28:12,917 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 05:28:12,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-28 05:28:12,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:28:12,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-28 05:28:12,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-28 05:28:12,918 INFO L87 Difference]: Start difference. First operand 1653 states and 3543 transitions. Second operand 13 states. [2019-12-28 05:28:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:28:15,209 INFO L93 Difference]: Finished difference Result 6993 states and 15167 transitions. [2019-12-28 05:28:15,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-28 05:28:15,210 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 83 [2019-12-28 05:28:15,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:28:15,216 INFO L225 Difference]: With dead ends: 6993 [2019-12-28 05:28:15,216 INFO L226 Difference]: Without dead ends: 4328 [2019-12-28 05:28:15,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=276, Invalid=1284, Unknown=0, NotChecked=0, Total=1560 [2019-12-28 05:28:15,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4328 states. [2019-12-28 05:28:15,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4328 to 1702. [2019-12-28 05:28:15,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2019-12-28 05:28:15,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 3597 transitions. [2019-12-28 05:28:15,275 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 3597 transitions. Word has length 83 [2019-12-28 05:28:15,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:28:15,275 INFO L462 AbstractCegarLoop]: Abstraction has 1702 states and 3597 transitions. [2019-12-28 05:28:15,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-28 05:28:15,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 3597 transitions. [2019-12-28 05:28:15,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 05:28:15,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:28:15,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] [2019-12-28 05:28:15,279 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:28:15,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:28:15,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1193195599, now seen corresponding path program 3 times [2019-12-28 05:28:15,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:28:15,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431755843] [2019-12-28 05:28:15,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:28:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 05:28:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 05:28:15,507 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 05:28:15,507 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 05:28:15,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 05:28:15 BasicIcfg [2019-12-28 05:28:15,677 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 05:28:15,679 INFO L168 Benchmark]: Toolchain (without parser) took 44091.36 ms. Allocated memory was 144.2 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 100.6 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-28 05:28:15,680 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-28 05:28:15,681 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.77 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.2 MB in the beginning and 156.1 MB in the end (delta: -55.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-28 05:28:15,681 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.07 ms. Allocated memory is still 201.3 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 05:28:15,681 INFO L168 Benchmark]: Boogie Preprocessor took 37.16 ms. Allocated memory is still 201.3 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-28 05:28:15,682 INFO L168 Benchmark]: RCFGBuilder took 801.36 ms. Allocated memory is still 201.3 MB. Free memory was 151.4 MB in the beginning and 110.4 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. [2019-12-28 05:28:15,682 INFO L168 Benchmark]: TraceAbstraction took 42409.94 ms. Allocated memory was 201.3 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 110.4 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-28 05:28:15,685 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.50 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 777.77 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.2 MB in the beginning and 156.1 MB in the end (delta: -55.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.07 ms. Allocated memory is still 201.3 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.16 ms. Allocated memory is still 201.3 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 801.36 ms. Allocated memory is still 201.3 MB. Free memory was 151.4 MB in the beginning and 110.4 MB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42409.94 ms. Allocated memory was 201.3 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 110.4 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L699] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L701] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L703] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L704] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L705] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L706] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L707] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L708] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L709] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L710] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L711] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L712] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L713] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L714] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L715] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L718] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 0 pthread_t t2567; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] FCALL, FORK 0 pthread_create(&t2567, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] 0 pthread_t t2568; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK 0 pthread_create(&t2568, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L759] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L760] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L761] 2 x$r_buff0_thd2 = (_Bool)1 [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L733] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L737] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L738] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x = x$flush_delayed ? x$mem_tmp : x [L741] 1 x$flush_delayed = (_Bool)0 [L746] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L771] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L800] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 128 locations, 2 error locations. Result: UNSAFE, OverallTime: 42.0s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6468 SDtfs, 9985 SDslu, 14895 SDs, 0 SdLazy, 7205 SolverSat, 632 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 91 SyntacticMatches, 11 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57888occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 65811 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1596 NumberOfCodeBlocks, 1596 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1489 ConstructedInterpolants, 0 QuantifiedInterpolants, 240865 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...